cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A288582 A288581(n) written in base 2.

Original entry on oeis.org

1, 0, 1, 10, 1001, 1001010, 100101001001, 10010100100101001010, 100101001001010010100100101001001, 100101001001010010100100101001001010010100100101001010, 1001010010010100101001001010010010100101001001010010100100101001001010010100100101001001
Offset: 0

Views

Author

N. J. A. Sloane, Jul 04 2017

Keywords

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).

Crossrefs

Extensions

More terms from Rémy Sigrist, Feb 26 2019