A273433 Smallest base b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^n).

3, 8, 57, 1047, 27216, 861642, 21444846, 674273372, 147534349327, 45941644105613, 244158265828023, 569209871196597077, 15204969799577672558, 2111244131216208612515, 129192323492968413250921, 25814874251189658671192458, 13543096262710710570994132579

Offset: 1

Author

Felix Fröhlich, May 22 2016

Keywords

• nonn

Links

• Hiroaki Yamanouchi, Table of n, a(n) for n = 1..46

Crossrefs

Cf. A257833.

Programs

PARI

a(n) = my(p=prime(n), b=2); while(Mod(b, p^n)^(p-1)!=1, b++); b

Formula

a(n) = A257833(n, n) for n > 1.

Extensions

a(9)-a(17) from Hiroaki Yamanouchi, May 26 2016