|
| |
|
|
A288582
|
|
A288581(n) written in base 2.
|
|
2
|
|
|
|
1, 0, 1, 10, 1001, 1001010, 100101001001, 10010100100101001010, 100101001001010010100100101001001, 100101001001010010100100101001001010010100100101001010, 1001010010010100101001001010010010100101001001010010100100101001001010010100100101001001
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,4
|
|
|
COMMENTS
|
Define the sequence of finite Fibonacci words f_i by f_0=1, f_1=0, and thereafter f_n is the concatenation f_{n-1} f_{n-2}. The limit of f_i as i -> oo is the infinite Fibonacci word A003849.
Then f_0 = a(0), f_1 = a(1), and for n>1, f_n is the concatenation 0 a(n).
|
|
|
LINKS
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
