Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074782
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
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; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A119409 A109603 A087091 this_sequence A117111 A081260 A043385

Adjacent sequences: A074779 A074780 A074781 this_sequence A074783 A074784 A074785

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 07 2002

page 1

Search completed in 0.004 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research