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”).
%I #11 Feb 24 2020 15:59:56
%S 2,31,353,9559783,9559843,9559903,3779853313,27788573801,204475054073,
%T 204475054723,1505578024807,1505578025779,241849345578351691,
%U 1784546064357413809,1784546064357419959,97199410027249994623,97199410027250046643,97199410027250047453,97199410027250123143
%N Primes p such that p+2 = 0 (mod pi(p)), where pi(p)=A000720(p) is the prime counting function.
%F a(n) = A000040(A092044(n)).
%o (PARI) p=c=0; until(0, (2+p=nextprime(p+1))%c++ || print1(p",")) \\ PARI syntax for || updated Feb 20 2020
%Y Cf. A156152.
%K nonn
%O 1,1
%A _M. F. Hasler_, Feb 04 2009
%E More terms from _Max Alekseyev_, May 03 2009
%E a(13)-a(19) from _Giovanni Resta_, Feb 23 2020