|
%I #13 Jan 14 2020 03:25:20
%S 1,0,1,0,2,1,0,0,4,1,0,0,3,6,1,0,0,4,10,8,1,0,0,0,12,21,10,1,0,0,0,12,
%T 32,28,12,1,0,0,0,6,45
%N Triangle read by rows: T(n,k) (n >= 1, 2 <= k <= n-1) is number of non-crossing trees with k nodes and path-length n.
%H E. Deutsch and M. Noy, <a href="http://dx.doi.org/10.1016/S0012-365X(01)00366-1">Statistics on non-crossing trees</a>, Discrete Math., 254 (2002), 75-87 (see Th. 6).
%e Triangle begins:
%e 1
%e 0 1
%e 0 2 1
%e 0 0 4 1
%e 0 0 3 6 1
%e 0 0 4 10 8 1
%e 0 0 0 12 21 10 1
%e 0 0 0 12 32 28 12 1
%K nonn,tabl,more
%O 1,5
%A _N. J. A. Sloane_, Jan 17 2012
|
