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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074782 Let b(1)=b(2)=1, b(k) = (2^b(k-1)+2^b(k-2)) (mod k); sequence gives values of n such that b(n)=0. 0
4, 10, 16, 20, 24, 40, 64, 80, 128, 144, 192, 256, 358, 528, 1152, 1536, 1600, 1672, 2048, 2052, 2056, 2176, 2260, 2560, 2804, 3072, 3898, 4528, 5120, 5139, 6144, 7361, 7776, 12288, 15026, 15619, 16237, 16360, 16384, 16512, 18432, 23165, 24576 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

Sequence in context: A109603 A162410 A087091 * A117111 A081260 A190060

Adjacent sequences:  A074779 A074780 A074781 * A074783 A074784 A074785

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 07 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 06:46 EST 2012. Contains 205867 sequences.