The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A215002 Number of all solid standard Young tableaux of shape [[n,k],[n-k]] for 0<=k<=n. 7

%I

%S 1,2,10,60,398,2764,19796,144536,1070294,8007052,60380940,458185992,

%T 3494554380,26764583096,205711091880,1585822364592,12256625999718,

%U 94942581080204,736895626109148,5729374337686696,44615143884080996,347905737091032552,2716349710039969688

%N Number of all solid standard Young tableaux of shape [[n,k],[n-k]] for 0<=k<=n.

%H Alois P. Heinz, <a href="/A215002/b215002.txt">Table of n, a(n) for n = 0..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 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a>

%F See Maple programs.

%F a(n) ~ sqrt((5*sqrt(5))/2-11/2) * 8^n / sqrt(Pi*n). - _Vaclav Kotesovec_, Jul 16 2014

%p b:= proc(x, y, z) option remember; `if`(z>y, b(x, z, y),

%p `if`({x, y, z}={0}, 1, `if`(x>y and x>z, b(x-1, y, z), 0)+

%p `if`(y>0, b(x, y-1, z), 0)+ `if`(z>0, b(x, y, z-1), 0)))

%p end:

%p a:= n-> add(b(n, k, n-k), k=0..n):

%p seq(a(n), n=0..25);

%p # second Maple program:

%p a:= proc(n) option remember; `if`(n<4, [1, 2, 10, 60][n+1],

%p ((1640*n^8 -1180*n^7 -7114*n^6 +5615*n^5 +20240*n^4 -35170*n^3

%p +20379*n^2 -4050*n) *a(n-1) +(-7640*n^8 +14560*n^7 +47374*n^6

%p -140900*n^5 -37160*n^4 +601810*n^3 -944154*n^2 +580680*n -113400)

%p *a(n-2) +(-28800*n^8 +181440*n^7 -138240*n^6 -874800*n^5 +670680*n^4

%p +3165480*n^3 -3646440*n^2 -12960*n -453600) *a(n-3) +(207360*n^8

%p -1451520*n^7 +912384*n^6 +11767680*n^5 -15720480*n^4 -42042240*n^3

%p +92516256*n^2 -50388480*n +16329600) *a(n-4)) / (n* (n+1) *(2*n-1)

%p *(2*n+1) *(20*n^4-47*n^2-33*n+90)))

%p end:

%p seq(a(n), n=0..25);

%t b[x_, y_, z_] := b[x, y, z] = If[z>y, b[x, z, y], If[Union[{x, y, z}] == {0}, 1, If[x>y && x>z, b[x-1, y, z], 0] + If[y>0, b[x, y-1, z], 0] + If[z>0, b[x, y, z-1], 0]]]; T[n_, k_] := b[n, k, n-k]; a[n_] := Sum[T[n, k], {k, 0, n}]; Table[a[n], {n, 0, 22}] (* _Jean-François Alcover_, Feb 05 2015, after _Alois P. Heinz_ *)

%Y Row sums of A214775.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Jul 30 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 18 06:22 EST 2021. Contains 340250 sequences. (Running on oeis4.)