id:A083653 - OEIS Search Results

Search: id:A083653

Displaying 1-1 of 1 results found.

page 1

Consider the binary Champernowne sequence (A030190): smallest number m such that in binary representation n is contained in the concatenation of m and its successors.

+0
3

0, 1, 2, 1, 4, 2, 1, 3, 8, 4, 10, 2, 3, 1, 3, 7, 16, 8, 4, 9, 18, 10, 21, 2, 7, 3, 9, 1, 3, 5, 7, 15, 32, 16, 8, 17, 36, 4, 9, 19, 34, 18, 10, 10, 37, 21, 2, 6, 15, 7, 3, 12, 19, 9, 21, 1, 7, 3, 19, 5, 7, 13, 15, 31, 64, 32, 16, 33, 8, 34, 17, 35, 68, 36, 18, 4, 73, 9, 19, 39, 66, 34, 20, 18 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`a(n)<=n; see A083655 for numbers m with a(m)=m;` `a(A055143(n))=1;` `A083654(n)-1 = number of successors of a(n) to cover n.`
	EXAMPLE	`n=24: '11000'=24 is a suffix of the concatenation of the first 8 numbers: '0'1'10'11'100'101'110'111'1000', therefore a(24)=7 and A083654(24)=2.`
	CROSSREFS	`Cf. A030304, A007088.` `Sequence in context: A088423 A006839 A118235 this_sequence A135152 A147542 A128177` `Adjacent sequences: A083650 A083651 A083652 this_sequence A083654 A083655 A083656`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 01 2003`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research