|
|
A156153
|
|
Primes p such that p == 2 (mod pi(p)) and pi(p) is prime.
|
|
4
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(PARI) p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p-2)%c & next; print1(p, ", ")); \\ Modified by Jinyuan Wang, Feb 22 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|