|
%I #29 Nov 08 2017 08:57:58
%S 2,16,91,456,2145,9724,43043,187408,806208,3436720,14545982,61214960,
%T 256411935,1069854660,4449173475,18450500640,76326664260,315077780160,
%U 1298203997610,5340028714800,21932944632690,89963953083576,368565304248846,1508283816983776
%N Number of solid standard Young tableaux of shape [[(2)^n],[2]].
%C a(n) is odd if and only if n = 3 or n in { 2^k-3, 2^k-1 : k = 3,4,5, ... }.
%H Alois P. Heinz, <a href="/A214824/b214824.txt">Table of n, a(n) for n = 1..1000</a>
%H S. B. Ekhad, D. Zeilberger, <a href="https://arxiv.org/abs/1202.6229">Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux</a>, arXiv:1202.6229v1 [math.CO], 2012.
%H G. Kreweras, <a href="http://dx.doi.org/10.1016/0012-365X(79)90163-8">Sur les extensions lineaires d'une famille particuliere d'ordres partiels</a>, Discrete Math., 27 (1979), 279-295.
%H G. Kreweras, <a href="/A006330/a006330_1.pdf">Sur les extensions linéaires d'une famille particulière d'ordres partiels</a>, Discrete Math., 27 (1979), 279-295. (Annotated scanned copy)
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a>
%F a(n) = 2*(2*n+1)*(n^2+5*n+2)*n/((n-1)*(n+3)*(n^2+3*n-2))*a(n-1); a(1) = 2.
%p a:= proc(n) option remember; `if`(n=1, 2,
%p (4+(18+(22+4*n)*n)*n)*n*a(n-1)/(6+(-13+(1+(5+n)*n)*n)*n))
%p end:
%p seq(a(n), n=1..30);
%t a[1] = 2; a[n_] := a[n] = (4 + (18 + (22 + 4*n)*n)*n)*n*a[n - 1]/(6 + (-13 + (1 + (5 + n)*n)*n)*n); Array[a, 30] (* _Jean-François Alcover_, Nov 08 2017, translated from Maple *)
%Y Row n=2 of A214722 and of A259101.
%K nonn
%O 1,1
%A _Alois P. Heinz_, Jul 28 2012
|
