login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215581 The limit of the string "0, 1" under the operation 'append last k terms, append first k terms, increment k' with k=1 initially. 0

%I

%S 0,1,1,0,1,0,0,1,0,0,1,0,1,1,1,0,1,1,0,1,1,0,1,0,1,1,0,0,1,1,0,1,0,0,

%T 1,1,0,1,0,1,1,0,1,0,1,0,1,1,0,1,0,0,1,1,0,1,0,0,0,0,1,1,0,1,0,0,0,1,

%U 1,0,1,0,0,1,0,0,1,1,0,1,0,0,1,0,1,1

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

%C An infinite binary word.

%C b(n) = sum of the first 10^n terms begins: 0, 4, 50, 534, 5218, 48127, 517287, 5390832, 53047574, 504439952, 4838747337.

%e 01 -> 01 1 0 -> 0110 10 01 -> 01101001 001 011 etc.

%o (Python)

%o TOP = 1000

%o a = [0]*TOP

%o a[1] = 1

%o n = 2

%o k = 1

%o while n+k*2 < TOP:

%o a[n:] = a[n-k:n]

%o n += k

%o a[n:] = a[:k]

%o n += k

%o k += 1

%o for k in range(n):

%o print a[k],

%Y Cf. A094186, A215531, A215532.

%K nonn,easy

%O 0

%A _Alex Ratushnyak_, Aug 16 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 12:16 EDT 2021. Contains 343839 sequences. (Running on oeis4.)