A137161 - OEIS

This site is supported by donations to The OEIS Foundation.

A137161

Starting at Step=0 from the sequence 1, 0, 1, 0, 1, 0, etc. (A059841) at any Step=n, with n>=1, any numbers of the previous step is inserted in the sequence any (2*n-1) numbers.

1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,1`
	COMMENTS	`If the sequence is regarded as the binary representation of the number 0.1101011111110...... in decimal it is 0.843596927232253....`
	EXAMPLE	`Step n=0: 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, etc.` `Step n=1: 2n-1=1 thus after any 1 number -> 1 number of Step=0 is inserted` `1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, etc.` `Step n=2: 2n-1=3 thus after any 3 numbers -> 1 number of Step=1 is inserted` `1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, etc.` `Step n=3: 2*n-1=5 thus after any 5 numbers -> 1 number of Step=2 is inserted` `1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, etc.` `And so on.`
	CROSSREFS	`Cf. A137162, A137163.` `Sequence in context: A039982 A131372 A098457 * A077050 A128432 A195198` `Adjacent sequences: A137158 A137159 A137160 * A137162 A137163 A137164`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paolo P. Lava & Giorgio Balzarotti (paoloplava(AT)gmail.com), Jan 25 2008, Mar 05 2008`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 07:59 EST 2012. Contains 205604 sequences.