A123564 -id:A123564 - cp's OEIS frontend

A143667 Digits of the infinite Fibonacci word A003849 grouped 2 by 2 and interpreted as a binary value.

1, 0, 2, 2, 1, 0, 2, 2, 1, 1, 0, 2, 1, 1, 0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 2, 1, 1, 0, 2, 1, 1, 0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 2, 1, 0, 2, 2, 1, 1, 0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 2, 1, 0, 2, 2, 1, 1, 0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 2, 1, 0, 2, 2, 1, 1, 0, 2, 1, 1, 0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 2, 1, 1, 0

Offset: 1

Alexis Monnerot-Dumaine, Aug 28 2008

Group 2 by 2 the successive letters of the infinite Fibonacci word A003849 then apply: 00->0, 01->1 and 10->2.
Also result of the following iterated morphism: 1->1022, 0->10221, 2->1021, iterated from letter 1. (Monnerot 2008)
Fractal properties studied (proposed for publication)
(a(n)) is essentially the same sequence as A123564. Simply change the alphabet to {1,2,3}, and permute the letters. The Standard Form of (a(n)) written as a word on the alphabet {a,b,c} is abccabccaabc... . Other forms for this standard form are 1,2,3,3,1,2,3,3,1,1,2,3,.... and 123312331123... - _Michel Dekking, Oct 07 2017
(a(n)) is the fixed point of the 2-block map (called 2-block Fibonacci to the power 3) 00->0100101001, 01->01001010, 10->01001001, followed by the coding above. - Michel Dekking, Sep 26 2017

			a(1) = 1 because the infinite Fibonacci word starts with "01", a(2) = 0 because it continues with "00", and so on.

M. Lothaire, Combinatorics on words, Cambridge University Press.

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
J.-P. Allouche, M. Mendès France, and G. Skordev, Non-intersectivity of Paperfolding Dragon Curves and of Curves Generated by Automatic Sequences, INTEGERS, Electronic Journal of Combinatorial Number Theory, vol. 18A, Article #A2, 2018. Mentions this sequence.
Wieb Bosma and Henk Don, Constructing Morphisms for Arithmetic Subsequences of Fibonacci, Ch. 6, Logics and Type Systems in Theory and Practice (2024) Lect. Notes Comp. Sci. (LNCS) Vol. 14560, 100-110.
F. Michel Dekking, Morphisms, Symbolic Sequences, and Their Standard Forms, Journal of Integer Sequences, Vol. 19 (2016), Article 16.1.1.
Michel Dekking and Mike Keane, Two-block substitutions and morphic words, arXiv:2202.13548 [math.CO], 2022.
A. Monnerot-Dumaine, The Fibonacci Word Fractal.
Alexis Monnerot-Dumaine, The Fibonacci word fractal [Cached copy, with permission]
J. L. Ramírez and G. N. Rubiano, Properties and Generalizations of the Fibonacci Word Fractal, The Mathematica Journal, Vol. 16 (2014). See "Dense Fibonacci word". - _N. J. A. Sloane_, Mar 26 2014

Cf. A003849, A123564.

a143667 n = a143667_list !! (n-1)
a143667_list = f a003849_list where
   f (0:0:ws) = 0 : f ws; f (0:1:ws) = 1 : f ws; f (1:0:ws) = 2 : f ws
-- Reinhard Zumkeller, Jul 29 2014

Table[3 - (Floor[#1 #2] - 2 Floor[#1 (#2 - 1)] + Floor[#1 (#2 + 1)]) & @@ {1/GoldenRatio, 2 n}, {n, 100}] (* Michael De Vlieger, Oct 06 2017 *)

a(n) = decimal value of b(2n-1)b(2n), b(n) taken from A003849 (infinite Fibonacci word).

A143668 Result of the morphing 01->01021212, 02->0102121201, 12->01021201, iterated from '01'. Sequence of the Fibonacci word fractal.

Original entry on oeis.org

0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2

Offset: 1

Alexis Monnerot-Dumaine, Aug 28 2008

nonn

Letter '2' is always in an even position and '0' an odd position.
When replacing '2' by '0', equals the infinite Fibonacci word (see A003849).
This sequence produces the Fibonacci word fractal when applying the following turtle graphics rules: 0->draw segment+turn right, 1-> draw segment, 2-> draw segment+turn left (A. Monnerot-Dumaine 2008 see links).
This sequence is the [1->12, 2->01, 3->02]-transform of A123564. - Michel Dekking, Mar 03 2018

M. Lothaire, Combinatorics on words, Cambridge University press.

Alexis Monnerot-Dumaine, The Fibonacci Word Fractal, HAL Id : hal-00367972, 2009.
Alexis Monnerot-Dumaine, The Fibonacci word fractal [Cached copy, with permission]

Cf. A003849, A123564.

Let (b(n)) be the infinite Fibonacci word. if (b(n)=0 and n is even), then a(n)=2, else a(n)=b(n).

cp's OEIS Frontend

A143667 Digits of the infinite Fibonacci word A003849 grouped 2 by 2 and interpreted as a binary value.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

Formula