login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218433 Sum of the 6th powers of the numbers of standard Young tableaux over all partitions of n. 2

%I #13 May 18 2017 03:48:16

%S 1,1,2,66,1524,86100,19902600,3965056200,976304082600,384973061999400,

%T 347437227718904400,365434181398477976400,390696545168036224840800,

%U 475968229571639505471170400,784642922815221782474131569600,2070759893211522247088843511422400

%N Sum of the 6th powers of the numbers of standard Young tableaux over all partitions of n.

%H Alois P. Heinz, <a href="/A218433/b218433.txt">Table of n, a(n) for n = 0..60</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a>

%p h:= proc(l) local n; n:=nops(l); add(i, i=l)! /mul(mul(1+l[i]-j

%p +add(`if`(l[k]>=j, 1, 0), k=i+1..n), j=1..l[i]), i=1..n)

%p end:

%p g:= proc(n, i, l) `if`(n=0, h(l)^6, `if`(i<1, 0, g(n, i-1, l)+

%p `if`(i>n, 0, g(n-i, i, [l[], i]))))

%p end:

%p a:= n-> `if`(n=0, 1, g(n, n, [])):

%p seq(a(n), n=0..20);

%t 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 g[n_, i_, l_] := g[n, i, l] = If[n == 0, h[l]^6, If[i < 1, 0, g[n, i - 1, l] + If[i > n, 0, g[n - i, i, Append[l, i]]]]];

%t a[n_] := If[n == 0, 1, g[n, n, {}]];

%t Table[a[n], {n, 0, 20}] (* _Jean-Fran├žois Alcover_, May 18 2017, translated from Maple *)

%Y Column k=6 of A208447.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Oct 28 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 19 17:53 EDT 2024. Contains 373507 sequences. (Running on oeis4.)