Smallest base b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^n).
A273433
Smallest base b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^n).
Terms
- a(0) =3a(1) =8a(2) =57a(3) =1047a(4) =27216a(5) =861642a(6) =21444846a(7) =674273372a(8) =147534349327
External references
- oeis: A273433