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 A210427 #22 Sep 20 2020 13:36:59
%S A210427 0,1,12,69,260,751,1812,3843,7400,13221,22252,35673,54924,81731,
%T A210427 118132,166503,229584,310505,412812,540493,698004,890295,1122836,
%U A210427 1401643,1733304,2125005,2584556,3120417,3741724,4458315,5280756,6220367,7289248,8500305,9867276
%N A210427 Number of semistandard Young tableaux over all partitions of 5 with maximal element <= n.
%H A210427 Bruno Berselli, <a href="/A210427/b210427.txt">Table of n, a(n) for n = 0..1000</a>
%H A210427 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a>
%H A210427 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (6,-15,20,-15,6,-1).
%F A210427 a(n) = n*(12+(35+13*n^2)*n^2)/60.
%F A210427 G.f.: x*(12*x^2+6*x^3+x^4+1+6*x)/(x-1)^6.
%p A210427 a:= n-> n*(12+(35+13*n^2)*n^2)/60:
%p A210427 seq(a(n), n=0..40);
%t A210427 LinearRecurrence[{6,-15,20,-15,6,-1},{0,1,12,69,260,751},40] (* _Harvey P. Dale_, Sep 20 2020 *)
%Y A210427 Row n=5 of A210391.
%K A210427 nonn,easy
%O A210427 0,3
%A A210427 _Alois P. Heinz_, Mar 21 2012