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

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

Offset

0

Comments

An infinite binary word.

b(n) = sum of the first 10^n terms begins: 0, 3, 35, 342, 3425, 33759, 343464, 3447277, 34183683, 338743553, 3382195010.

Links

Robert Israel, Table of n, a(n) for n = 0..9999

Example

01 -> 010 -> 010 010 -> 010010 01001 ->  01001001001 0100100 etc.

Maple

S:= "01": k:= 1:
for i from 1 to 10 do
  S:= cat(S, S[1..k]);
  k:= k+2;
od:
seq(parse(S[i]), i=1..length(S)); # Robert Israel, Jun 12 2018

Mathematica

Module[{k = -1}, Nest[Join[#, #[[;; (k += 2)]]] &, {0, 1}, 10]] (* Paolo Xausa, Nov 23 2024 *)

Prog

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

Crossrefs

Cf. A094186, A215532, A215530.

Sequence in context: A286655 A272170 A126565 * A305386 A174998 A257800

Adjacent sequences: A215528 A215529 A215530 * A215532 A215533 A215534

Keyword

nonn,easy

Author

Alex Ratushnyak, Aug 15 2012

Status

approved