[go: up one dir, main page]

login
A156153
Primes p such that p == 2 (mod pi(p)) and pi(p) is prime.
4
5, 41, 367, 9559817, 514275529
OFFSET
1,1
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
M. F. Hasler, Feb 04 2009
STATUS
approved