|
Search: id:A066687
|
|
|
| A066687 |
|
Numbers n such that p(n) is congruent to n mod EulerPhi(n), where p(n) denotes the n-th prime. |
|
+0
1
|
|
| 1, 2, 3, 11, 15, 67, 209, 439, 1285, 4393, 11513, 31037, 133361, 181411, 225209, 637337, 637339
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
p(3) = 5 is congruent to 3 mod EulerPhi(2) = 2; so 3 is a term of the sequence.
|
|
MATHEMATICA
|
Select[ Range[ 1, 10^6 ], Mod[ #, EulerPhi[ # ] ] == Mod[ Prime[ # ], EulerPhi[ # ] ] & ]
|
|
CROSSREFS
|
Adjacent sequences: A066684 A066685 A066686 this_sequence A066688 A066689 A066690
Sequence in context: A041637 A042235 A050587 this_sequence A076514 A071012 A091734
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Jan 11 2002
|
|
|
Search completed in 0.002 seconds
|
