id:A127117 - OEIS Search Results

Search: id:A127117

Displaying 1-1 of 1 results found.

page 1

A sequence of binary numbers. The first number is 1. Thereafter each number a(n) is defined using the previous number a(n-1) in the following way : a(n)=a(n-1).b(n-1) where the dot means the concatenation operation and b(n-1) stands for the first number that is not present in a(n-1), using the usual order (1, 10, 11, 100, 101, etc.).

+0
1

1, 10, 1011, 1011100, 10111001000, 101110010001010, 1011100100010101101, 10111001000101011011111, 1011100100010101101111110000, 101110010001010110111111000010011 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Nicolas Wicker, Tcl program`
	EXAMPLE	`a(3)=1011 because a(2)=10 and 0, 1 and 10 are present in a(2) but 11 is not, so we append 11 to a(2) getting 10.11=1011.`
	CROSSREFS	`Sequence in context: A037220 A138484 A022506 this_sequence A154703 A067104 A166507` `Adjacent sequences: A127114 A127115 A127116 this_sequence A127118 A127119 A127120`
	KEYWORD	`easy,nonn,base`
	AUTHOR	`Nicolas Wicker (wicker(AT)igbmc.u-strasbg.fr), Mar 21 2007`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research