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

%I

%S 5,20,51891,51893

%N Numbers n such that prime(prime(n))+2 = 0 (mod prime(n)), where prime(p)=A000040(p) is the p-th prime.

%F a(n) = A000720(A156149(n))

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

%Y Cf. A156155.

%K hard,more,nonn

%O 1,1

%A _M. F. Hasler_, Feb 04 2009

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 August 17 11:06 EDT 2019. Contains 326057 sequences. (Running on oeis4.)