|
Search: id:A067733
|
|
|
| A067733 |
|
Numbers n such that phi(prime(n)-1)==0 (mod n). |
|
+0
1
|
|
| 1, 12, 540, 1024, 1072, 1092, 1320, 1408, 4272, 16200, 29568, 40082, 43740, 56592, 123192, 251736, 265440, 276000, 664320, 725760, 758560, 771264, 2101248
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
Select[Range[42000], Mod[EulerPhi[Prime[ # ] - 1], # ] == 0 &]
|
|
PROGRAM
|
(PARI) for(k=1, 2600000, if(eulerphi(prime(k)-1)%k==0, print1(k, ", ")))
|
|
CROSSREFS
|
Sequence in context: A012686 A012466 A004801 this_sequence A064344 A163046 A133415
Adjacent sequences: A067730 A067731 A067732 this_sequence A067734 A067735 A067736
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 05 2002
|
|
EXTENSIONS
|
More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Feb 13 2002
|
|
|
Search completed in 0.002 seconds
|
