The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A156152 Primes p such that p = 2 (mod pi(p)), where pi(p) = A000720(p) is the prime counting function. 4
 2, 5, 41, 47, 347, 367, 9559817, 514272793, 514274807, 514275529, 3779851091, 27788568469, 27788573621, 204475055227, 11091501631937, 81744303098923, 602656752070661, 602656752071189, 241849345578327359, 241849345578328451, 241849345578337811, 1784546064357416683 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Giovanni Resta, Table of n, a(n) for n = 1..28 FORMULA a(n) = A000040(A023144(n)). MATHEMATICA 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 *) PROG (PARI) p=c=0; until(0, (-2+p=nextprime(p+1))%c++ || print1(p, ", ")) CROSSREFS Cf. A156151, A156153 (primes from this sequence). Sequence in context: A162035 A245242 A004096 * A106885 A072439 A286560 Adjacent sequences:  A156149 A156150 A156151 * A156153 A156154 A156155 KEYWORD nonn AUTHOR M. F. Hasler, Feb 04 2009 EXTENSIONS More terms from Max Alekseyev, May 03 2009 a(15)-a(16) from Jinyuan Wang, Feb 22 2020 Terms a(17) and beyond from Giovanni Resta, Feb 23 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 28 07:49 EDT 2021. Contains 346321 sequences. (Running on oeis4.)