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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 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
 1, 2, 10, 60, 398, 2764, 19796, 144536, 1070294, 8007052, 60380940, 458185992, 3494554380, 26764583096, 205711091880, 1585822364592, 12256625999718, 94942581080204, 736895626109148, 5729374337686696, 44615143884080996, 347905737091032552, 2716349710039969688 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 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 programs. a(n) ~ sqrt((5*sqrt(5))/2-11/2) * 8^n / sqrt(Pi*n). - Vaclav Kotesovec, Jul 16 2014 MAPLE b:= proc(x, y, z) option remember; `if`(z>y, b(x, z, y),       `if`({x, y, z}={0}, 1, `if`(x>y and 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)))     end: a:= n-> add(b(n, k, n-k), k=0..n): seq(a(n), n=0..25); # second Maple program: a:= proc(n) option remember; `if`(n<4, [1, 2, 10, 60][n+1],       ((1640*n^8 -1180*n^7 -7114*n^6 +5615*n^5 +20240*n^4 -35170*n^3        +20379*n^2 -4050*n) *a(n-1) +(-7640*n^8 +14560*n^7 +47374*n^6        -140900*n^5 -37160*n^4 +601810*n^3 -944154*n^2 +580680*n -113400)        *a(n-2) +(-28800*n^8 +181440*n^7 -138240*n^6 -874800*n^5 +670680*n^4        +3165480*n^3 -3646440*n^2 -12960*n -453600) *a(n-3) +(207360*n^8        -1451520*n^7 +912384*n^6 +11767680*n^5 -15720480*n^4 -42042240*n^3        +92516256*n^2 -50388480*n +16329600) *a(n-4)) / (n* (n+1) *(2*n-1)        *(2*n+1) *(20*n^4-47*n^2-33*n+90)))     end: seq(a(n), n=0..25); MATHEMATICA 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 *) CROSSREFS Row sums of A214775. Sequence in context: A004981 A214764 A137571 * A301625 A262001 A276310 Adjacent sequences:  A214999 A215000 A215001 * A215003 A215004 A215005 KEYWORD nonn AUTHOR Alois P. Heinz, Jul 30 2012 STATUS approved

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 November 26 09:38 EST 2020. Contains 338639 sequences. (Running on oeis4.)