OFFSET
2,1
LINKS
Alois P. Heinz, Table of n, a(n) for n = 2..500
S. B. Ekhad, D. Zeilberger, Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux, arXiv:1202.6229v1 [math.CO], 2012
Wikipedia, Young tableau
FORMULA
See Maple program.
a(n) ~ 3 * 2^(2*n-1) * sqrt(n) / sqrt(Pi). - Vaclav Kotesovec, Sep 02 2014
a(n) = 12*(1 - 4*n + 10*n^2 - 8*n^3 + 2*n^4) * (2*n-4)! / ((n-2)! * (n+1)!). - Vaclav Kotesovec, Sep 02 2014
MAPLE
a:= proc(n) option remember; `if`(n=2, 2,
2*(4*n^5 -26*n^4 +60*n^3 -58*n^2 +22*n -5)*a(n-1)/
(2*n^5 -14*n^4 +30*n^3 -10*n^2 -31*n +25))
end:
seq(a(n), n=2..30);
MATHEMATICA
Table[12*(1 - 4*n + 10*n^2 - 8*n^3 + 2*n^4) * (2*n-4)! / ((n-2)! * (n+1)!), {n, 2, 20}] (* Vaclav Kotesovec, Sep 02 2014 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Aug 07 2012
STATUS
approved