A156149 - 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

A156149

Primes p such that prime(p)+2 = 0 (mod p), where prime(p)=A000040(p) is the p-th prime.

3

11, 71, 637319, 637327

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

OFFSET

1,1

COMMENTS

The subsequence of primes in A092044.

LINKS

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

FORMULA

a(n) = A000720(A156150(n)) = A000040(A156148(n))

PROG

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

CROSSREFS

Sequence in context: A034196 A236173 A092044 * A258402 A006975 A260585

Adjacent sequences: A156146 A156147 A156148 * A156150 A156151 A156152

KEYWORD

hard,more,nonn

AUTHOR

M. F. Hasler, Feb 04 2009

STATUS

approved