|
|
A156155
|
|
Numbers k such that prime(prime(k)) = 2 (mod prime(k)), where prime(k) = A000040(k) is the k-th prime.
|
|
3
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(PARI) p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p-2)%c & next; print1( primepi(c)", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|