A275338
Smallest prime p where a base b with 1 < b < p exists such that b^(p-1) == 1 (mod p^n).
offset: 1
codomain: ℕ
The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.
Declarations
Section titled “Declarations”- A275338computable