A156151 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Table of n, a(n) for n=1..19.

FORMULA

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

PROG

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

CROSSREFS

Cf. A156152.

Sequence in context: A333935 A152278 A343415 * A231796 A218687 A071360