|
Search: id:A080843
|
|
|
| A080843 |
|
Tribonacci word: limit S(infinity), where S(0) = 0, S(1) = 0,1, S(2) = 0,1,0,2 and for n>=0, S(n+3) = S(n+2) S(n+1) S(n). |
|
+0
4
|
|
| 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
An Arnoux-Rauzy or episturmian word.
|
|
REFERENCES
|
J. Berstel and J. Karhumaki, Combinatorics on words - a tutorial, Bull. EATCS, #79 (2003), pp. 178-228.
|
|
LINKS
|
N. J. A. Sloane, Table of n, a(n) for n = 0..19512
Jean Berstel, Home Page
D. Damanik and L. Q. Zamboni, Arnoux-Rauzy subshifts: linear recurrence, powers and palindromes.
|
|
FORMULA
|
Fixed point of morphism 0 -> 0, 1; 1 -> 0, 2; 2 -> 0.
|
|
MAPLE
|
M:=17; S[1]:=`0`; S[2]:=`01`; S[3]:=`0102`;
for n from 4 to M do S[n]:=cat(S[n-1], S[n-2], S[n-3]); od:
t0:=S[M]: l:=length(t0); for i from 1 to l do lprint(i, substring(t0, i..i)); od: (N. J. A. Sloane, Nov 01 2006)
|
|
MATHEMATICA
|
Nest[ Function[l, {Flatten[(l /. {0 -> {0, 1}, 1 -> {0, 2}, 2 -> {0}})]}], {0}, 8] (from Robert G. Wilson v Feb 26 2005)
|
|
CROSSREFS
|
Cf. A003849 (the Fibonacci word).
Sequence in context: A107064 A113687 A071006 this_sequence A087371 A112762 A145171
Adjacent sequences: A080840 A080841 A080842 this_sequence A080844 A080845 A080846
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 29 2003
|
|
EXTENSIONS
|
More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 2003
|
|
|
Search completed in 0.002 seconds
|
