login
A273433
Smallest base b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^n).
1
3, 8, 57, 1047, 27216, 861642, 21444846, 674273372, 147534349327, 45941644105613, 244158265828023, 569209871196597077, 15204969799577672558, 2111244131216208612515, 129192323492968413250921, 25814874251189658671192458, 13543096262710710570994132579
OFFSET
1,1
LINKS
Hiroaki Yamanouchi, Table of n, a(n) for n = 1..46
FORMULA
a(n) = A257833(n, n) for n > 1.
PROG
(PARI) a(n) = my(p=prime(n), b=2); while(Mod(b, p^n)^(p-1)!=1, b++); b
CROSSREFS
Cf. A257833.
Sequence in context: A101361 A104034 A000825 * A132517 A027262 A062358
KEYWORD
nonn
AUTHOR
Felix Fröhlich, May 22 2016
EXTENSIONS
a(9)-a(17) from Hiroaki Yamanouchi, May 26 2016
STATUS
approved