login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156148 Numbers n such that prime(prime(n))+2 = 0 (mod prime(n)), where prime(p)=A000040(p) is the p-th prime. 1
5, 20, 51891, 51893 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

FORMULA

a(n) = A000720(A156149(n))

PROG

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

CROSSREFS

Cf. A156155.

Sequence in context: A002030 A213148 A202860 * A224867 A156824 A053002

Adjacent sequences:  A156145 A156146 A156147 * A156149 A156150 A156151

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 July 23 22:47 EDT 2019. Contains 325278 sequences. (Running on oeis4.)