|
|
A259502
|
|
Primes p such that nextprime(p + 1)^(p - 1) == 1 (mod p^2).
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
These are Wieferich primes p to a prime base q where the difference between p and q has minimal or almost minimal (if the difference between p and the previous prime is smaller) value.
No further terms up to 10^9.
|
|
LINKS
|
|
|
PROG
|
(PARI) forprime(p=1, , if(Mod(nextprime(p+1), p^2)^(p-1)==1, print1(p, ", ")))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|