This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A215550 #11 Feb 08 2017 18:35:07 %S A215550 0,16796,15737865,574221648,7766844470,60610884906,331670995656, %T A215550 1414591812920,5014392953273,15408077648040,42254306265171, %U A215550 105611585968616,244384627765200,529868222188998,1086607184873210,2123449623259536,3978448975695051,7182177974166580 %N A215550 Number of standard Young tableaux of shape [10n,10]. %C A215550 Also the number of binary words with 10n 1's and 10 0's such that for every prefix the number of 1's is >= the number of 0's. %H A215550 Alois P. Heinz, <a href="/A215550/b215550.txt">Table of n, a(n) for n = 0..1000</a> %H A215550 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a> %F A215550 G.f.: (9*x^10 -99*x^9 -140503*x^8 -25387417*x^7 -510202946*x^6 -2566871318*x^5 -4166581331*x^4 -2313217577*x^3 -402028913*x^2 -15553109*x -16796)*x / (x-1)^11. %F A215550 a(n) = C(10*n+10,10)*(10*n-9)/(10*n+1) for n>0, a(0) = 0. %p A215550 a:= n-> max(0, binomial(10*n+10,10)*(10*n-9)/(10*n+1)): %p A215550 seq(a(n), n=0..30); %Y A215550 Row n=10 of A214776. %K A215550 nonn %O A215550 0,2 %A A215550 _Alois P. Heinz_, Aug 16 2012