|
Search: id:A067933
|
|
|
| A067933 |
|
Primes p such that p == -1 (mod phi(p-1)). |
|
+0
2
|
| |
|
|
OFFSET
|
1,1
|
|
|
MATHEMATICA
|
Do[p = Prime[n]; If[ Mod[p + 1, EulerPhi[p - 1]] == 0, Print[p]], {n, 1, 10^8}]
|
|
CROSSREFS
|
Sequence in context: A085300 A119388 A093487 this_sequence A005234 A141500 A059999
Adjacent sequences: A067930 A067931 A067932 this_sequence A067934 A067935 A067936
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 22 2002
|
|
EXTENSIONS
|
Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 27 2002
|
|
|
Search completed in 0.002 seconds
|
