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 A210430 #17 Feb 09 2017 16:11:17 %S A210430 0,1,25,294,2090,10460,40677,131131,366088,912519,2075965,4381168, %T A210430 8683962,16321682,29310113,50595765,84373024,136476493,214859601, %U A210430 330171322,496443610,731902920,1059919949,1510112495,2119617096,2934545875,4011645781,5420178180 %N A210430 Number of semistandard Young tableaux over all partitions of 8 with maximal element <= n. %H A210430 Bruno Berselli, <a href="/A210430/b210430.txt">Table of n, a(n) for n = 0..1000</a> %H A210430 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a> %H A210430 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (9,-36,84,-126,126,-84,36,-9,1). %F A210430 a(n) = n^2*(n^2+3)*(1124+(1205+191*n^2)*n^2)/10080. %F A210430 G.f.: -x*(x+1)*(x^6+15*x^5+90*x^4+170*x^3+90*x^2+15*x+1)/(x-1)^9. %p A210430 a:= n-> n^2*(n^2+3)*(1124+(1205+191*n^2)*n^2)/10080: %p A210430 seq(a(n), n=0..40); %Y A210430 Row n=8 of A210391. %K A210430 nonn,easy %O A210430 0,3 %A A210430 _Alois P. Heinz_, Mar 21 2012