id:A083654 - OEIS Search Results

Search: id:A083654

Displaying 1-1 of 1 results found.

page 1

Consider the binary Champernowne sequence (A030190): number of successive numbers to be concatenated beginning with A083653(n) such that in binary representation n is contained.

+0
3

1, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 3, 2, 2, 1, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 2, 2, 3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 3, 3, 3, 2, 3, 3, 2, 2, 3, 2, 2, 2 (list; graph; listen)

	OFFSET	`0,4`
	COMMENT	`a(2^k)=1, see A083655 for all numbers m with a(m)=1;`
	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)=2 and A083653(24)=7.`
	CROSSREFS	`Cf. A030304, A007088.` `Sequence in context: A128538 A115588 A105220 this_sequence A164878 A029428 A101422` `Adjacent sequences: A083651 A083652 A083653 this_sequence A083655 A083656 A083657`
	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