OFFSET
2,6
COMMENTS
LINKS
P. Flajolet and M. Noy, Analytic combinatorics of non-crossing configurations, Discrete Math., 204, 203-229, 1999.
FORMULA
T(n, k) = binomial(n+k-2, k)*(Sum_{i=0..floor((n-2-k)/2)} binomial(n-2+k+i, i)*binomial(n-3-k-i, i-1))/(n-1).
G.f.: G=G(t, z) satisfies (1-t)G^3 + (1+t)zG^2 - z^2*(1+z)G + z^4 = 0.
EXAMPLE
T(5,1)=5 because the dissections of a convex pentagon having exactly one triangle are obtained by the placement of a diagonal between any pair of non-adjacent vertices.
T(6,0)=4 because the dissections of a convex hexagon with no triangles are obtained by the null placement and by placing one diagonal between any of the 3 pairs of opposite vertices.
Triangle starts:
1;
0, 1;
1, 0, 2;
1, 5, 0, 5;
4, 6, 21, 0, 14;
8, 35, 28, 84, 0, 42;
...
MAPLE
T := (n, k)->binomial(n+k-2, k)*sum(binomial(n-2+k+i, i)*binomial(n-3-k-i, i-1), i=0..floor((n-2-k)/2))/(n-1): seq(seq(T(n, k), k=0..n-2), n=2..14);
MATHEMATICA
T [n_, k_] := Binomial[n+k-2, k] Sum[Binomial[n-2+k+i, i] Binomial[n-3-k-i, i-1], {i, 0, (n-2-k)/2}]/(n-1);
Table[T[n, k], {n, 2, 12}, {k, 0, n-2}] // Flatten (* Jean-François Alcover, Jul 29 2018 *)
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Emeric Deutsch, Feb 28 2004
STATUS
approved