%I #8 Mar 12 2014 16:36:45
%S 1,1,2,1,2,2,3,1,2,2,3,2,3,3,3,3,2,1,1,2,2,3,2,3,3,3,3,2,1,2,3,3,3,3,
%T 2,1,3,3,3,2,1,3,3,2,1,3,3,2,1,3,3,2,1,3,2,1,2,2,3,2,3,3,3,3,2,1,2,3,
%U 3,3,3,2,1,3,3,3,2,1,3,3,2,1,3,3,2,1,3,3,2,1,3,2,2,3,3,3,3,2,1,3,3,3,2,1,3
%N Triangle read by rows, based on the morphism f: 1->{2}, 2->{3}, 3->{3,3,2,1}. First row is 1. If current row is a,b,c,..., then the next row is a,b,c,...,f(a),f(b),f(c),...
%C Kenyon tile substitution sequence.
%H Richard Kenyon, <a href="http://arXiv.org/abs/math.MG/9505210">The Construction of Self-Similar Tilings</a>
%t s[n_] := n /. {1 -> 2, 2 -> 3, 3 -> {3, 3, 2, 1}}; t[a_] := Join[a, Flatten[s /@ a]]; Flatten[ NestList[t, {1}, 5]]
%Y Cf. A073058, A099206.
%K nonn,tabf
%O 0,3
%A _Roger L. Bagula_, Mar 28 2005