login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215532 The limit of the string "0, 1" under the operation 'append first k terms, increment k' with k=2 initially. 4
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 (list; graph; refs; listen; history; text; internal format)
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
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
Sequence in context: A288466 A285073 A276394 * A191152 A139312 A323239
KEYWORD
nonn,easy
AUTHOR
Alex Ratushnyak, Aug 15 2012
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 11:55 EDT 2024. Contains 371763 sequences. (Running on oeis4.)