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

Offset

0,1

Comments

If the sequence is regarded as the binary representation of the number 0.1101011111110...... in decimal it is 0.843596927232253....

Links

Table of n, a(n) for n=0..104.

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: 2*n-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: 2*n-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: A098457 A284793 A260397 * A329677 A077050 A128432

Adjacent sequences: A137158 A137159 A137160 * A137162 A137163 A137164

Keyword

easy,nonn

Author

Paolo P. Lava and Giorgio Balzarotti, Jan 25 2008, Mar 05 2008

Status

approved