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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 G. M. Barabash, Y. M. Kholyavka, I. V. Tytar, Periodic words connected with the Fibonacci words, Carpathian Math. Publ. 2016, 8 (1), 11-15; doi:10.15330/cmp.8.1.11-15. CROSSREFS Cf. A003849, A288581. Sequence in context: A071925 A139101 A015482 * A104486 A098753 A276758 Adjacent sequences:  A288579 A288580 A288581 * A288583 A288584 A288585 KEYWORD nonn AUTHOR N. J. A. Sloane, Jul 04 2017 EXTENSIONS More terms from Rémy Sigrist, Feb 26 2019 STATUS approved

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.

Last modified October 21 09:09 EDT 2020. Contains 337911 sequences. (Running on oeis4.)