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

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). 0
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; internal format)
OFFSET

1,2

CROSSREFS

Sequence in context: A036131 A115424 A008881 * A059174 A054044 A008859

Adjacent sequences:  A069047 A069048 A069049 * A069051 A069052 A069053

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 03 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 18:43 EST 2012. Contains 205939 sequences.