|
%I #18 Feb 23 2020 08:38:16
%S 2,5,41,47,347,367,9559817,514272793,514274807,514275529,3779851091,
%T 27788568469,27788573621,204475055227,11091501631937,81744303098923,
%U 602656752070661,602656752071189,241849345578327359,241849345578328451,241849345578337811,1784546064357416683
%N Primes p such that p = 2 (mod pi(p)), where pi(p) = A000720(p) is the prime counting function.
%H Giovanni Resta, <a href="/A156152/b156152.txt">Table of n, a(n) for n = 1..28</a>
%F a(n) = A000040(A023144(n)).
%t f[p_,n_]:=Mod[p,n]==2; lst={};Do[p=Prime[n];If[f[p,n],AppendTo[lst,p]],{n,11!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Dec 08 2009 *)
%o (PARI) p=c=0; until(0, (-2+p=nextprime(p+1))%c++ || print1(p, ", "))
%Y Cf. A156151, A156153 (primes from this sequence).
%K nonn
%O 1,1
%A _M. F. Hasler_, Feb 04 2009
%E More terms from _Max Alekseyev_, May 03 2009
%E a(15)-a(16) from _Jinyuan Wang_, Feb 22 2020
%E Terms a(17) and beyond from _Giovanni Resta_, Feb 23 2020
|
