|
|
A066687
|
|
Numbers n such that prime(n) == n (mod phi(n)).
|
|
0
|
|
|
1, 2, 3, 11, 15, 67, 209, 439, 1285, 4393, 11513, 31037, 133361, 181411, 225209, 637337, 637339, 7351279, 10253001, 10553551, 339144639, 416538907, 639770919, 4631809783
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
p(3) = 5 is congruent to 3 mod phi(2) = 2, so 3 is a term of the sequence.
|
|
MATHEMATICA
|
Select[ Range[ 1, 10^6 ], Mod[ #, EulerPhi[ # ] ] == Mod[ Prime[ # ], EulerPhi[ # ] ] & ]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|