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 A218437 #12 May 18 2017 03:23:44 %S A218437 1,1,2,1026,119124,82094580,1126524259080,5563004909321160, %T A218437 43453047082604239080,620787527477497337506920, %U A218437 82539616591562766578923554000,8875098123308028836585309148354000,891186933432311275150434427455009708000 %N A218437 Sum of the 10th powers of the numbers of standard Young tableaux over all partitions of n. %H A218437 Alois P. Heinz, <a href="/A218437/b218437.txt">Table of n, a(n) for n = 0..60</a> %H A218437 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a> %p A218437 h:= proc(l) local n; n:=nops(l); add(i, i=l)! /mul(mul(1+l[i]-j %p A218437 +add(`if`(l[k]>=j, 1, 0), k=i+1..n), j=1..l[i]), i=1..n) %p A218437 end: %p A218437 g:= proc(n, i, l) `if`(n=0, h(l)^10, `if`(i<1, 0, g(n, i-1, l)+ %p A218437 `if`(i>n, 0, g(n-i, i, [l[], i])))) %p A218437 end: %p A218437 a:= n-> `if`(n=0, 1, g(n, n, [])): %p A218437 seq(a(n), n=0..20); %t A218437 h[l_] := With[{n = Length[l]}, Total[l]!/Product[Product[1 + l[[i]] - j + Sum[If[l[[k]] >= j, 1, 0], {k, i + 1, n}], {j, 1, l[[i]]}], {i, 1, n}]]; %t A218437 g[n_, i_, l_] := g[n, i, l] = If[n == 0, h[l]^10, If[i < 1, 0, g[n, i - 1, l] + If[i > n, 0, g[n - i, i, Append[l, i]]]]]; %t A218437 a[n_] := If[n == 0, 1, g[n, n, {}]]; %t A218437 Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, May 18 2017, translated from Maple *) %Y A218437 Column k=10 of A208447. %K A218437 nonn %O A218437 0,3 %A A218437 _Alois P. Heinz_, Oct 28 2012