A156151 Primes p such that p+2 = 0 (mod pi(p)), where pi(p)=A000720(p) is the prime counting function.

2, 31, 353, 9559783, 9559843, 9559903, 3779853313, 27788573801, 204475054073, 204475054723, 1505578024807, 1505578025779, 241849345578351691, 1784546064357413809, 1784546064357419959, 97199410027249994623, 97199410027250046643, 97199410027250047453, 97199410027250123143

Offset: 1

Author

M. F. Hasler, Feb 04 2009

Keywords

• nonn

Crossrefs

Cf. A156152.

Programs

PARI

p=c=0; until(0, (2+p=nextprime(p+1))%c++ || print1(p",")) \\ PARI syntax for || updated Feb 20 2020

Formula

a(n) = A000040(A092044(n)).

Extensions

More terms from Max Alekseyev, May 03 2009

a(13)-a(19) from Giovanni Resta, Feb 23 2020