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

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156150 Primes p such that p+2 = 0 (mod pi(p)) and pi(p)=A000720(p) is prime. 1
31, 353, 9559783, 9559903 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

A subsequence of A156151.

LINKS

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

FORMULA

a(n) = A000040(A156149(n))

PROG

(PARI) p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p+2)%c & next; print1( p", "))

CROSSREFS

Cf. A156153.

Sequence in context: A197644 A295211 A261759 * A125419 A138440 A307008

Adjacent sequences:  A156147 A156148 A156149 * A156151 A156152 A156153

KEYWORD

hard,more,nonn

AUTHOR

M. F. Hasler, Feb 04 2009

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 00:21 EST 2021. Contains 349530 sequences. (Running on oeis4.)