login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A229330 Total sum of 8th powers of parts in all partitions of n. 2
0, 1, 258, 6821, 72872, 470319, 2229624, 8464487, 27530298, 78974938, 206418978, 497450302, 1126668140, 2410089243, 4930872330, 9670306930, 18336637198, 33650085029, 60146112858, 104730757818, 178524931538, 297898015114, 488407670832, 786658901771 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

The bivariate g.f. for the partition statistic "sum of 8th powers of the parts" is G(t,x) = 1/Product_{k>=1}(1 - t^{k^8}*x^k). The g.f. g at the Formula section has been obtained by evaluating dG/dt at t=1. - Emeric Deutsch, Dec 06 2015

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..1000

Guo-Niu Han, An explicit expansion formula for the powers of the Euler Product in terms of partition hook lengths, arXiv:0804.1849 [math.CO], 2008.

FORMULA

a(n) = Sum_{k=1..n} A066633(n,k) * k^8.

G.f.: g(x) = (Sum_{k>=1} k^8*x^k/(1-x^k))/Product_{q>=1}(1-x^q). - Emeric Deutsch, Dec 06 2015

a(n) ~ 13063680*sqrt(2)*Zeta(9)/Pi^9 * exp(Pi*sqrt(2*n/3)) * n^(7/2). - Vaclav Kotesovec, May 28 2018

MAPLE

b:= proc(n, i) option remember; `if`(n=0, [1, 0],

      `if`(i<1, [0, 0], `if`(i>n, b(n, i-1),

      ((g, h)-> g+h+[0, h[1]*i^8])(b(n, i-1), b(n-i, i)))))

    end:

a:= n-> b(n, n)[2]:

seq(a(n), n=0..40);

# second Maple program:

g := (sum(k^8*x^k/(1-x^k), k = 1..100))/(product(1-x^k, k = 1..100)): gser := series(g, x = 0, 45): seq(coeff(gser, x, m), m = 1 .. 40); # Emeric Deutsch, Dec 06 2015

MATHEMATICA

(* T = A066633 *) T[n_, n_] = 1; T[n_, k_] /; k < n := T[n, k] = T[n - k, k] + PartitionsP[n - k]; T[_, _] = 0; a[n_] := Sum[T[n, k]*k^8, {k, 1, n}]; Array[a, 40, 0] (* Jean-Fran├žois Alcover, Dec 15 2016 *)

CROSSREFS

Column k=8 of A213191.

Sequence in context: A233306 A282060 A301546 * A253636 A271759 A228998

Adjacent sequences:  A229327 A229328 A229329 * A229331 A229332 A229333

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Sep 20 2013

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 29 09:35 EST 2020. Contains 332355 sequences. (Running on oeis4.)