A254990 4-bonacci word. Fixed point of morphism 0->01, 1->02, 2->03, 3->0.
0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 3
Offset: 0
Examples
The iterates are: 0 01 0102 01020103 010201030102010 01020103010201001020103010201 01020103010201001020103010201010201030102010010201030102 ...
Links
- Seiichi Manyama, Table of n, a(n) for n = 0..10000
- Elena Barcucci, Luc Belanger and Srecko Brlek, On tribonacci sequences, Fib. Q., 42 (2004), 314-320. See Section 4.
- F. Michel Dekking, Morphisms, Symbolic Sequences, and Their Standard Forms, Journal of Integer Sequences, Vol. 19 (2016), Article 16.1.1.
- O. Turek, Abelian Complexity Function of the Tribonacci Word, J. Int. Seq. 18 (2015) # 15.3.4
Crossrefs
Programs
-
Mathematica
Nest[Flatten[#/.{0->{0,1},1->{0,2},2->{0,3},3->0}]&,0,7] (* Harvey P. Dale, Mar 26 2015 *)
Comments