%I A080843
%S A080843 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,
%T A080843 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,
%U A080843 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
%N 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).
%C A080843 An Arnoux-Rauzy or episturmian word.
%D A080843 J. Berstel and J. Karhumaki, Combinatorics on words - a tutorial, Bull. 
               EATCS, #79 (2003), pp. 178-228.
%H A080843 N. J. A. Sloane, <a href="b080843.txt">Table of n, a(n) for n = 0..19512</
               a>
%H A080843 Jean Berstel, <a href="http://www-igm.univ-mlv.fr/~berstel/">Home Page</
               a>
%H A080843 D. Damanik and L. Q. Zamboni, <a href="http://arXiv.org/abs/math.CO/0208137">
               Arnoux-Rauzy subshifts: linear recurrence, powers and palindromes</
               a>.
%F A080843 Fixed point of morphism 0 -> 0, 1; 1 -> 0, 2; 2 -> 0.
%p A080843 M:=17; S[1]:=`0`; S[2]:=`01`; S[3]:=`0102`;
%p A080843 for n from 4 to M do S[n]:=cat(S[n-1], S[n-2], S[n-3]); od:
%p A080843 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)
%t A080843 Nest[ Function[l, {Flatten[(l /. {0 -> {0, 1}, 1 -> {0, 2}, 2 -> {0}})]}], 
               {0}, 8] (from Robert G. Wilson v Feb 26 2005)
%Y A080843 Cf. A003849 (the Fibonacci word).
%Y A080843 Sequence in context: A107064 A113687 A071006 this_sequence A087371 A112762 
               A145171
%Y A080843 Adjacent sequences: A080840 A080841 A080842 this_sequence A080844 A080845 
               A080846
%K A080843 nonn,easy
%O A080843 0,4
%A A080843 N. J. A. Sloane (njas(AT)research.att.com), Mar 29 2003
%E A080843 More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 
               06 2003