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!)
A288582 A288581(n) written in base 2. 2

%I #18 Feb 26 2019 08:22:11

%S 1,0,1,10,1001,1001010,100101001001,10010100100101001010,

%T 100101001001010010100100101001001,

%U 100101001001010010100100101001001010010100100101001010,1001010010010100101001001010010010100101001001010010100100101001001010010100100101001001

%N A288581(n) written in base 2.

%C 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.

%C Then f_0 = a(0), f_1 = a(1), and for n>1, f_n is the concatenation 0 a(n).

%H G. M. Barabash, Y. M. Kholyavka, I. V. Tytar, <a href="http://dx.doi.org/10.15330/cmp.8.1.11-15">Periodic words connected with the Fibonacci words</a>, Carpathian Math. Publ. 2016, 8 (1), 11-15; doi:10.15330/cmp.8.1.11-15.

%Y Cf. A003849, A288581.

%K nonn

%O 0,4

%A _N. J. A. Sloane_, Jul 04 2017

%E More terms from _Rémy Sigrist_, Feb 26 2019

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 March 29 04:59 EDT 2024. Contains 371264 sequences. (Running on oeis4.)