This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A118268 a(0)= A118269(0) = 1. Place A118269(n) written in binary to end of sequence A118268 (with each binary digit entered separately and where '0' is appended to sequence if A118269(n) = 0). A118269(n) is number of times n written in binary occurs among the earlier terms (before A118269(n) in binary is added) of this sequence concatenated. 3
 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS EXAMPLE 21 in binary is 10101. This sequence up to just before the binary A118269(21) is appended is (after concatenation) 110101100011110101001. 10101 occurs twice in this concatenated string. So A118269(21) is 2 and {1,0} (representing a binary 2) is appended to the end of this sequence. CROSSREFS Cf. A118269. Sequence in context: A093075 A104120 A108336 * A143220 A103842 A065535 Adjacent sequences:  A118265 A118266 A118267 * A118269 A118270 A118271 KEYWORD easy,nonn,base AUTHOR Leroy Quet, Apr 20 2006 EXTENSIONS More terms from Franklin T. Adams-Watters, May 14 2010 STATUS approved

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 .