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”).

A069050
Numbers k such that 2^k mod phi(k) = 2^phi(k) mod k.
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
OFFSET
1,2
LINKS
MATHEMATICA
Select[Range[13000], PowerMod[2, #, EulerPhi[#]]==PowerMod[2, EulerPhi[ #], #]&] (* Harvey P. Dale, Aug 21 2016 *)
CROSSREFS
Sequence in context: A335853 A247213 A302934 * A343844 A059174 A258585
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Apr 03 2002
STATUS
approved