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.

A218434 Sum of the 7th powers of the numbers of standard Young tableaux over all partitions of n.

This page as a plain text file.
%I A218434 #12 May 18 2017 03:23:21
%S A218434 1,1,2,130,4504,468956,298313896,134324703472,76943411156480,
%T A218434 75584451935796484,231249690461453112208,784105479220668188046200,
%U A218434 2566797235899935973173794336,9244479688068495046254956909968,48983678227627955151056666560212512
%N A218434 Sum of the 7th powers of the numbers of standard Young tableaux over all partitions of n.
%H A218434 Alois P. Heinz, <a href="/A218434/b218434.txt">Table of n, a(n) for n = 0..60</a>
%H A218434 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a>
%p A218434 h:= proc(l) local n; n:=nops(l); add(i, i=l)! /mul(mul(1+l[i]-j
%p A218434        +add(`if`(l[k]>=j, 1, 0), k=i+1..n), j=1..l[i]), i=1..n)
%p A218434     end:
%p A218434 g:= proc(n, i, l) `if`(n=0, h(l)^7, `if`(i<1, 0, g(n, i-1, l)+
%p A218434       `if`(i>n, 0, g(n-i, i, [l[], i]))))
%p A218434     end:
%p A218434 a:= n-> `if`(n=0, 1, g(n, n, [])):
%p A218434 seq(a(n), n=0..20);
%t A218434 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 A218434 g[n_, i_, l_] := g[n, i, l] = If[n == 0, h[l]^7, If[i < 1, 0, g[n, i - 1, l] + If[i > n, 0, g[n - i, i, Append[l, i]]]]];
%t A218434 a[n_] := If[n == 0, 1, g[n, n, {}]];
%t A218434 Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, May 18 2017, translated from Maple *)
%Y A218434 Column k=7 of A208447.
%K A218434 nonn
%O A218434 0,3
%A A218434 _Alois P. Heinz_, Oct 28 2012