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 A210431 #19 Feb 08 2017 19:20:34 %S A210431 0,1,30,434,3740,22220,100562,370909,1168008,3245311,8148590,18821968, %T A210431 40542228,82300842,158779362,293092635,520505744,893364637,1487517086, %U A210431 2410539918,3812130380,5897064040,8941168786,13310814265,19486468504,28090928475,39922889006 %N A210431 Number of semistandard Young tableaux over all partitions of 9 with maximal element <= n. %H A210431 Bruno Berselli, <a href="/A210431/b210431.txt">Table of n, a(n) for n = 0..1000</a> %H A210431 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a> %H A210431 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (10,-45,120,-210,252,-210,120,-45,10,-1). %F A210431 a(n) = n*(10080+(40484+(31395+(8106+655*n^2)*n^2)*n^2)*n^2)/90720. %F A210431 G.f.: x*(x^8+20*x^7+179*x^6+630*x^5+960*x^4+630*x^3+179*x^2+20*x+1) / (x-1)^10. %p A210431 a:= n-> n*(10080+(40484+(31395+(8106+655*n^2)*n^2)*n^2)*n^2)/90720: %p A210431 seq(a(n), n=0..40); %Y A210431 Row n=9 of A210391. %K A210431 nonn,easy %O A210431 0,3 %A A210431 _Alois P. Heinz_, Mar 21 2012