login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215557 Number of standard Young tableaux of shape [n^2,n]. 2

%I #23 Dec 08 2023 12:55:19

%S 1,1,9,154,3705,115101,4395118,199448964,10495906641,628737007195,

%T 42254306265171,3148956023335200,257758558133120135,

%U 22991045919047089170,2219652431230209792300,230617851021799852486856,25657807699789594931790369,3043509929953923167586547335

%N Number of standard Young tableaux of shape [n^2,n].

%C Also the number of binary words with n^2 1's and n 0's such that for every prefix the number of 1's is >= the number of 0's. The a(2) = 9 words are: 101011, 101101, 101110, 110011, 110101, 110110, 111001, 111010, 111100.

%H Alois P. Heinz, <a href="/A215557/b215557.txt">Table of n, a(n) for n = 0..337</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a>

%F a(n) = C((n+1)*n, n)*((n-1)*n+1)/(n*n+1).

%F a(n) = A214776(n,n).

%F a(n) = [x^n] ((1 - sqrt(1 - 4*x))/(2*x))^(n^2-n+1). - _Ilya Gutkovskiy_, Nov 01 2017

%p a:= n-> binomial((n+1)*n, n)*((n-1)*n+1)/(n*n+1):

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

%t Table[Binomial[n(n+1),n] (n(n-1)+1)/(n^2+1),{n,0,20}] (* _Harvey P. Dale_, Dec 08 2023 *)

%Y Main diagonal of A214776.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Aug 16 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:43 EDT 2024. Contains 371967 sequences. (Running on oeis4.)