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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068535 Numbers n such that 2^n (mod n) = 2^n (mod n^2). 3
1, 2, 4, 8, 16, 32, 35, 64, 128, 256, 297, 512, 1024, 1093, 2048, 2186, 2590, 3279, 3511, 4096, 4372, 5465, 6558, 7022, 7651, 8192, 8744, 9837, 10533, 10930, 13116, 14044, 14209, 16384, 21066, 23175, 24012, 24577, 26592, 28088, 31599, 32768 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Sequence contains all numbers of the form 2^k but also many others as the subsequence of primes in A001220(n).

CROSSREFS

Sequence in context: A115423 A045603 A072011 * A051505 A133408 A101434

Adjacent sequences:  A068532 A068533 A068534 * A068536 A068537 A068538

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 22 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 15 19:15 EST 2012. Contains 205852 sequences.