This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A276757 Infinite Fibonacci word on the alphabet {1,2,3,4,5}. 1
 1, 2, 3, 4, 5, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Start with the infinite Fibonacci word A003849, which is 0100101001001010010... and replace each 0 by 1,2,3 and each 1 by 4,5. The unique fixed point of the 4-block Fibonacci substitution 1 -> 12, 2 -> 3, 3 -> 45, 4 -> 12, 5 -> 3. Here the 4-blocks are coded as 0100 <-> 1, 1001 <-> 2, 0010 <-> 3, 0101 <-> 4, 1010 <-> 5. LINKS F. Michel Dekking, Morphisms, Symbolic Sequences, and Their Standard Forms, Journal of Integer Sequences, Vol. 19 (2016), Article 16.1.1. Michel Dekking and Michael Keane, On the conjugacy class of the Fibonacci dynamical system, arXiv preprint arXiv:1608.04487 [Math.DS], 2016. FORMULA Let A(n) = floor(n*phi), B(n) = n + floor(n*phi), i.e., A and B are the lower and upper Wythoff sequences, A = A000201, B = A001950. Then a(n) = 1 if n = A(A(A(k))) for some k; a(n) = 2 if n = B(A(k)) for some k; a(n) = 3 if n = A(B(k)) for some k; a(n) = 4 if n = A(A(B(k))) for some k; a(n) = 5 if n = B(B(k)) for some k. CROSSREFS Cf. A000201, A001950, A003849, A134859, A035336, A003623, A134860, A101864, A270788, A138967. Sequence in context: A277544 A190595 A280502 * A290397 A053841 A010884 Adjacent sequences:  A276754 A276755 A276756 * A276758 A276759 A276760 KEYWORD nonn AUTHOR Michel Dekking, Sep 17 2016 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 January 24 00:58 EST 2019. Contains 319404 sequences. (Running on oeis4.)