|
|
A267488
|
|
Smallest b > 1 such that there exists an odd prime p with p < b such that b^(p-1) == 1 (mod p^n).
|
|
0
|
|
|
4, 7, 18, 80, 242, 728, 2186, 6560, 19682, 59048, 177146, 531440
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n) = my(b=2); while(1, forprime(p=3, b-1, if(Mod(b, p^n)^(p-1)==1, return(b))); b++)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|