cp's OEIS Frontend

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.

A218435 Sum of the 8th powers of the numbers of standard Young tableaux over all partitions of n.

This page as a plain text file.
%I A218435 #13 May 18 2017 03:23:30
%S A218435 1,1,2,258,13380,2591940,4582623240,4616028796680,6229088692170120,
%T A218435 15072293332114590600,159846322935857039370000,
%U A218435 1733855206389212577000330000,17554952499518858027710809780000,183908030642450770233388352642100000
%N A218435 Sum of the 8th powers of the numbers of standard Young tableaux over all partitions of n.
%H A218435 Alois P. Heinz, <a href="/A218435/b218435.txt">Table of n, a(n) for n = 0..60</a>
%H A218435 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a>
%p A218435 h:= proc(l) local n; n:=nops(l); add(i, i=l)! /mul(mul(1+l[i]-j
%p A218435        +add(`if`(l[k]>=j, 1, 0), k=i+1..n), j=1..l[i]), i=1..n)
%p A218435     end:
%p A218435 g:= proc(n, i, l) `if`(n=0, h(l)^8, `if`(i<1, 0, g(n, i-1, l)+
%p A218435       `if`(i>n, 0, g(n-i, i, [l[], i]))))
%p A218435     end:
%p A218435 a:= n-> `if`(n=0, 1, g(n, n, [])):
%p A218435 seq(a(n), n=0..20);
%t A218435 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 A218435 g[n_, i_, l_] := g[n, i, l] = If[n == 0, h[l]^8, If[i < 1, 0, g[n, i - 1, l] + If[i > n, 0, g[n - i, i, Append[l, i]]]]];
%t A218435 a[n_] := If[n == 0, 1, g[n, n, {}]];
%t A218435 Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, May 18 2017, translated from Maple *)
%Y A218435 Column k=8 of A208447.
%K A218435 nonn
%O A218435 0,3
%A A218435 _Alois P. Heinz_, Oct 28 2012