login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066687 Numbers n such that prime(n) == n (mod phi(n)). 0

%I #8 Jan 03 2017 02:25:50

%S 1,2,3,11,15,67,209,439,1285,4393,11513,31037,133361,181411,225209,

%T 637337,637339,7351279,10253001,10553551,339144639,416538907,

%U 639770919,4631809783

%N Numbers n such that prime(n) == n (mod phi(n)).

%C a(25) > 10^12. - _Donovan Johnson_, Mar 14 2010

%e p(3) = 5 is congruent to 3 mod phi(2) = 2, so 3 is a term of the sequence.

%t Select[ Range[ 1, 10^6 ], Mod[ #, EulerPhi[ # ] ] == Mod[ Prime[ # ], EulerPhi[ # ] ] & ]

%K nonn

%O 1,2

%A _Joseph L. Pe_, Jan 11 2002

%E a(18)-a(24) from _Donovan Johnson_, Mar 14 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:06 EDT 2024. Contains 371967 sequences. (Running on oeis4.)