A321824 a(n) = Sum_{d|n, d==1 mod 4} d^8 - Sum_{d|n, d==3 mod 4} d^8.

1, 1, -6560, 1, 390626, -6560, -5764800, 1, 43040161, 390626, -214358880, -6560, 815730722, -5764800, -2562506560, 1, 6975757442, 43040161, -16983563040, 390626, 37817088000, -214358880, -78310985280, -6560, 152588281251, 815730722

Offset

1,3

Links

Seiichi Manyama, Table of n, a(n) for n = 1..10000

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).

Index entries for sequences mentioned by Glaisher.

Formula

a(n) = a(A000265(n)). - M. F. Hasler, Nov 26 2018

G.f.: Sum_{k>=1} (-1)^(k-1)*(2*k - 1)^8*x^(2*k-1)/(1 - x^(2*k-1)). - Ilya Gutkovskiy, Dec 06 2018

Multiplicative with a(2^e) = 1, and for an odd prime p, ((p^8)^(e+1)-1)/(p^8-1) if p == 1 (mod 4) and ((-p^8)^(e+1)-1)/(-p^8-1) if p == 3 (mod 4). - Amiram Eldar, Sep 27 2023

Mathematica

s[n_, r_] := DivisorSum[n, #^8 &, Mod[#, 4] == r &]; a[n_] := s[n, 1] - s[n, 3]; Array[a, 30] (* Amiram Eldar, Nov 26 2018 *)
f[p_, e_] := If[Mod[p, 4] == 1, ((p^8)^(e+1)-1)/(p^8-1), ((-p^8)^(e+1)-1)/(-p^8-1)]; f[2, e_] := 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 60] (* Amiram Eldar, Sep 27 2023 *)

Prog

(PARI) apply( A321824(n)=sumdiv(n>>valuation(n, 2), d, (2-d%4)*d^8), [1..40]) \\ M. F. Hasler, Nov 26 2018

Crossrefs

Column k=8 of A322143.

Cf. A321543 - A321565, A321807 - A321836 for similar sequences.

Cf. A000265.

Sequence in context: A236898 A252100 A137231 * A043488 A046321 A043456

Adjacent sequences: A321821 A321822 A321823 * A321825 A321826 A321827

Keyword

sign,easy,mult

Author

N. J. A. Sloane, Nov 24 2018

Extensions

Keyword mult from Ilya Gutkovskiy, Dec 06 2018

Status

approved