|
%I #5 Mar 12 2014 16:36:46
%S 1,1,2,1,2,2,3,1,2,2,3,2,3,3,3,5,4,1,2,2,3,2,3,3,3,5,4,2,3,3,3,5,4,3,
%T 3,5,4,3,5,4,3,5,4,6,5,1,2,2,3,2,3,3,3,5,4,2,3,3,3,5,4,3,3,5,4,3,5,4,
%U 3,5,4,6,5,2,3,3,3,5,4,3,3,5,4,3,5,4,3,5,4,6,5,3,3,5,4,3,5,4,3,5,4,6,5,3,5
%N Triangle read by rows, based on the morphism f: 1->2, 2->3, 3->{3,5,4}, 4->5, 5->6, 6->{6,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 6-symbol substitution based on the second type Rauzy substitution that gives a tile in the Kenyon boundary method.
%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, 5, 4}, 4 -> 5, 5 -> 6, 6 -> {6, 2, 1}}; t[a_] := Join[a, Flatten[s /@ a]]; Flatten[ NestList[t, {1}, 5]]
%Y Cf. A073058, A103684.
%K nonn,tabf
%O 0,3
%A _Roger L. Bagula_, Apr 07 2005
|
