|
|
A123352
|
|
Triangle read by rows, giving Kekulé numbers for certain benzenoids (see the Cyvin-Gutman book for details).
|
|
12
|
|
|
1, 1, 1, 1, 2, 1, 1, 3, 5, 1, 1, 4, 14, 14, 1, 1, 5, 30, 84, 42, 1, 1, 6, 55, 330, 594, 132, 1, 1, 7, 91, 1001, 4719, 4719, 429, 1, 1, 8, 140, 2548, 26026, 81796, 40898, 1430, 1, 1, 9, 204, 5712, 111384, 884884, 1643356, 379236, 4862, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
COMMENTS
|
|
|
LINKS
|
M. de Sainte-Catherine and G. Viennot, Enumeration of certain Young tableaux with bounded height, in: G. Labelle and P. Leroux (eds), Combinatoire énumérative, Lecture Notes in Mathematics, vol. 1234, Springer, Berlin, Heidelberg, 1986, pp. 58-67.
|
|
FORMULA
|
Triangle T(n,k) = (-1)^C(k+1,2) * Product{1 <= i <= j <= k} (-2*(n+1)+i+j)/(i+j). - Paul Barry, Jan 22 2009
T(n, k) = Product_{j=0..n-k-1} binomial(2*n-2*j, n-j)/binomial(n+j+1, n-j).
T(n, k) = ((n+1)!/(k+1)!)*Product_{j=0..n-k-1} Catalan(n-j)/binomial(n+j+1, n-j). (End)
|
|
EXAMPLE
|
Triangle T(n,k) (with rows n >= 0 and columns k >= 0) begins as follows:
1;
1, 1;
1, 2, 1;
1, 3, 5, 1;
1, 4, 14, 14, 1;
1, 5, 30, 84, 42, 1;
1, 6, 55, 330, 594, 132, 1;
1, 7, 91, 1001, 4719, 4719, 429, 1;
...
|
|
MATHEMATICA
|
A123352[n_, k_]:= Product[Binomial[2*n-2*j, n-j]/Binomial[n+j+1, n-j], {j, 0, n-k-1}];
|
|
PROG
|
(Sage)
def A123352(n, k): return product( binomial(2*n-2*j, n-j)/binomial(n+j+1, n-j) for j in (0..n-k-1) )
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|