A259502 Primes p such that nextprime(p + 1)^(p - 1) == 1 (mod p^2).
5, 47, 151051, 240727, 911135839
Offset: 1
Programs
-
PARI
forprime(p=1, , if(Mod(nextprime(p+1), p^2)^(p-1)==1, print1(p, ", ")))
This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
forprime(p=1, , if(Mod(nextprime(p+1), p^2)^(p-1)==1, print1(p, ", ")))
Comments