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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A321559 a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^3. 3
 1, -9, 28, -57, 126, -252, 344, -441, 757, -1134, 1332, -1596, 2198, -3096, 3528, -3513, 4914, -6813, 6860, -7182, 9632, -11988, 12168, -12348, 15751, -19782, 20440, -19608, 24390, -31752, 29792, -28089, 37296, -44226, 43344, -43149, 50654 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS G. C. Greubel, Table of n, a(n) for n = 1..1000 J. W. L. Glaisher, On the representations of a number as the sum of two, four, six, eight, ten, and twelve squares, Quart. J. Math. 38 (1907), 1-62 (see p. 4 and p. 8). FORMULA G.f.: Sum_{k>=1} (-1)^(k+1)*k^3*x^k/(1 + x^k). - Ilya Gutkovskiy, Nov 27 2018 MATHEMATICA a[n_] := DivisorSum[n, (-1)^(# + n/#)*#^3 &]; Array[a, 50] (* Amiram Eldar, Nov 27 2018 *) PROG (PARI) apply( A321559(n)=sumdiv(n, d, (-1)^(n\d-d)*d^3), [1..30]) \\ M. F. Hasler, Nov 26 2018 (MAGMA) m:=50; R:=PowerSeriesRing(Integers(), m); Coefficients(R!( (&+[(-1)^(k+1)*k^3*x^k/(1 + x^k) : k in [1..2*m]]) )); // G. C. Greubel, Nov 28 2018 (Sage) s=(sum((-1)^(k+1)*k^3*x^k/(1 + x^k)  for k in (1..50))).series(x, 50); a = s.coefficients(x, sparse=False); a[1:] # G. C. Greubel, Nov 28 2018 CROSSREFS Column k=3 of A322083. Cf. A321543 - A321565, A321807 - A321836 for similar sequences. Sequence in context: A031308 A063155 A135705 * A041359 A034126 A034677 Adjacent sequences:  A321556 A321557 A321558 * A321560 A321561 A321562 KEYWORD sign,mult AUTHOR N. J. A. Sloane, Nov 23 2018 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.

Last modified June 5 08:21 EDT 2020. Contains 334829 sequences. (Running on oeis4.)