|
|
A156151
|
|
Primes p such that p+2 = 0 (mod pi(p)), where pi(p)=A000720(p) is the prime counting function.
|
|
2
|
|
|
2, 31, 353, 9559783, 9559843, 9559903, 3779853313, 27788573801, 204475054073, 204475054723, 1505578024807, 1505578025779, 241849345578351691, 1784546064357413809, 1784546064357419959, 97199410027249994623, 97199410027250046643, 97199410027250047453, 97199410027250123143
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(PARI) p=c=0; until(0, (2+p=nextprime(p+1))%c++ || print1(p", ")) \\ PARI syntax for || updated Feb 20 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|