login
The OEIS is supported by the many generous donors 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; text; internal format)
OFFSET
1,1
LINKS
CROSSREFS
Sequence in context: A310496 A310497 A310498 * A310499 A310500 A310501
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Sep 07 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 06:32 EDT 2024. Contains 370953 sequences. (Running on oeis4.)