|
|
A215531
|
|
The limit of the string "0, 1" under the operation 'append first k terms, k=k+2' with k=1 initially.
|
|
4
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
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:
|
|
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],
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|