|
%I #10 Mar 31 2012 14:02:26
%S 1,1,1,2,0,1,3,1,0,1,5,0,0,0,1,6,2,1,0,0,1,10,0,0,0,0,0,1,11,5,0,1,0,
%T 0,0,1,18,0,2,0,0,0,0,0,1,21,11,0,0,1,0,0,0,0,1,34,0,0,0,0,0,0,0,0,0,
%U 1,35,26,3,2,0,1,0,0,0,0,0,1,68,0,0,0,0,0,0,0,0,0,0,0,1,69,66,0,0,0,0,1,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 Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
%H <a href="/index/Par#parens">Index entries for sequences related to parenthesizing</a>
%p [seq(A079217(n),n=0..119)]; A079217 := n -> PFixedByA057511(A003056(n)+1,1, A002262(n)+1);
%Y The row sums equal to the left edge shifted left once = A057546 = first row of A079216 (the latter gives the Maple procedure PFixedByA057511). Cf. also A079218, A079219, A079220, A079221, A079222 and A003056 and A002262.
%K nonn,tabl
%O 0,4
%A _Antti Karttunen_ Jan 03 2002
|
