login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,2
COMMENTS
a(25) > 10^12. - Donovan Johnson, Mar 14 2010
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
Sequence in context: A178430 A295128 A360520 * A144979 A194558 A076514
KEYWORD
nonn
AUTHOR
Joseph L. Pe, Jan 11 2002
EXTENSIONS
a(18)-a(24) from Donovan Johnson, Mar 14 2010
STATUS
approved