cp's OEIS Frontend

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.

A259502 Primes p such that nextprime(p + 1)^(p - 1) == 1 (mod p^2).

Original entry on oeis.org

5, 47, 151051, 240727, 911135839
Offset: 1

Views

Author

Felix Fröhlich, Nov 08 2015

Keywords

Comments

Nextprime as defined in A007918.
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.

Crossrefs

Programs

  • PARI
    forprime(p=1, , if(Mod(nextprime(p+1), p^2)^(p-1)==1, print1(p, ", ")))