|
%I #7 Mar 31 2012 14:02:26
%S 1,1,1,2,0,1,3,1,3,1,8,0,9,0,1,18,2,22,0,0,1,43,0,60,0,0,0,1,104,5,
%T 159,1,0,3,0,1,273,0,428,0,0,0,0,0,1,702,14,1143,0,1,9,0,0,0,1,1870,0,
%U 3114,0,0,0,0,0,0,0,1,4985,38,8505,2,0,28,0,0,3,0,0,1,13562,0,23475,0,0,0,0
%N Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=0, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the three-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
%C Note: the counts given here are inclusive, i.e. T(n,d) includes also the count A079217(n,d).
%p [seq(A079219(n),n=0..119)]; A079219 := n -> PFixedByA057511(A003056(n)+1,3, A002262(n)+1);
%Y The row sums equal to the left edge shifted left once = A079224 = third row of A079216 (the latter gives the Maple procedure PFixedByA057511). Cf. also A079217-A079222 and A003056 and A002262.
%K nonn,tabl
%O 0,4
%A _Antti Karttunen_ Jan 03 2002
|
