A215532 The limit of the string "0, 1" under the operation 'append first k terms, increment k' with k=2 initially.

0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0

Offset

0

Comments

An infinite binary word.

Sum of the first 10^n terms b(n) begins: 0, 4, 43, 440, 4344, 43826, 439780, 4344256, 43430906, 435183414, 4378550493.

Links

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

Example

01 -> 0101 -> 0101 010 -> 0101010 0101 -> 01010100101 01010 etc.

Prog

(Python)
TOP = 1000
a = [0]*TOP
a[1] = 1
n = k = 2
while n+k < TOP:
  a[n:] = a[:k]
  n += k
  k += 1
for k in range(n):
  print a[k],

Crossrefs

Cf. A094186, A215531, A215530.

Sequence in context: A288466 A285073 A276394 * A191152 A139312 A323239

Adjacent sequences: A215529 A215530 A215531 * A215533 A215534 A215535

Keyword

nonn,easy

Author

Alex Ratushnyak, Aug 15 2012

Status

approved