|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(PARI) a(n) = my(p=prime(n), b=2); while(Mod(b, p^n)^(p-1)!=1, b++); b
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|