A214637 Number of solid standard Young tableaux of shape [[n,n,n],[n,n],[n]].

1, 16, 17086, 61189172, 404233159860, 3880365678824980, 47959061464818182058, 711513280222442751394224, 12121127323153614807021655742, 230127245538294682127207785787376, 4767460278053986542112719904243778834, 106115342273795146740243750912097789131600

Offset

0,2

Links

Alois P. Heinz, Table of n, a(n) for n = 0..25

S. B. Ekhad, D. Zeilberger, Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux, arXiv:1202.6229v1 [math.CO], 2012

Wikipedia, Young tableau

Maple

b:= proc(l) option remember; local m; m:= nops(l);
      `if`({map(x-> x[], l)[]}={0}, 1, add(add(`if`(l[i][j]>
      `if`(i=m or nops(l[i+1])<j, 0, l[i+1][j]) and l[i][j]>
      `if`(nops(l[i])=j, 0, l[i][j+1]), b(subsop(i=subsop(
       j=l[i][j]-1, l[i]), l)), 0), j=1..nops(l[i])), i=1..m))
    end:
a:= n-> b([[n, n, n], [n, n], [n]]):
seq(a(n), n=0..10);

Mathematica

b[l_] := b[l] = With[{m := Length[l]}, If[Union[Flatten[l]] == {0}, 1, Sum[Sum[If[l[[i, j]] > If[i == m || Length[l[[i+1]]] < j, 0, l[[i+1, j]]] && l[[i, j]] > If[Length[l[[i]]] == j, 0, l[[i, j+1]]], b[ReplacePart[l, i -> ReplacePart[l[[i]], j -> l[[i, j]]-1]]], 0], {j, 1, Length[l[[i]]]}], {i, 1, m}]] ]; a[n_] := b[{{n, n, n}, {n, n}, {n}}]; Table[a[n], {n, 0, 11}] // Flatten (* Jean-François Alcover, Dec 18 2013, translated from Maple *)

Crossrefs

Cf. A213932, A213978, A214638.

Sequence in context: A017188 A168576 A013831 * A288957 A159387 A283720

Adjacent sequences: A214634 A214635 A214636 * A214638 A214639 A214640

Keyword

nonn

Author

Alois P. Heinz, Jul 23 2012

Status

approved