login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069050 Numbers n such that 2^n (mod phi(n)) = 2^phi(n) (mod n). 1
1, 2, 4, 8, 16, 32, 64, 108, 128, 188, 224, 252, 256, 288, 296, 336, 448, 504, 512, 576, 672, 716, 972, 1008, 1024, 1404, 1472, 2016, 2048, 2268, 2808, 3324, 3888, 4096, 4860, 5184, 5500, 6480, 7776, 8192, 8748, 8952, 9720, 9896, 11000, 11104, 12256 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..300

MATHEMATICA

Select[Range[13000], PowerMod[2, #, EulerPhi[#]]==PowerMod[2, EulerPhi[ #], #]&] (* Harvey P. Dale, Aug 21 2016 *)

CROSSREFS

Sequence in context: A208743 A247213 A302934 * A059174 A258585 A235701

Adjacent sequences:  A069047 A069048 A069049 * A069051 A069052 A069053

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre, Apr 03 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 01:57 EST 2019. Contains 329948 sequences. (Running on oeis4.)