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.

A156154 Primes p such that prime(p)=2 (mod p), where prime(p)=A000040(p) is the p-th prime.

Original entry on oeis.org

3, 13, 73, 637321, 27067133
Offset: 1

Views

Author

M. F. Hasler, Feb 04 2009

Keywords

Crossrefs

Cf. A156153.

Programs

  • Mathematica
    Select[Prime[Range[17*10^5]],Mod[Prime[#],#]==2&] (* Harvey P. Dale, Dec 28 2022 *)
  • PARI
    p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p-2)%c & next; print1( c","))

Formula

a(n) = A000040(A156155(n)) ; A156154 = intersection of A000040 and A023144.