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!)
A321831 a(n) = Sum_{d|n, n/d==1 mod 4} d^7 - Sum_{d|n, n/d==3 mod 4} d^7. 3
1, 128, 2186, 16384, 78126, 279808, 823542, 2097152, 4780783, 10000128, 19487170, 35815424, 62748518, 105413376, 170783436, 268435456, 410338674, 611940224, 893871738, 1280016384, 1800262812, 2494357760, 3404825446, 4584374272, 6103593751 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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

G.f.: Sum_{k>=1} k^7*x^k/(1 + x^(2*k)). - Ilya Gutkovskiy, Nov 26 2018

Multiplicative with a(p^e) = round(p^(7e+7)/(p^7 + p%4 - 2)), where p%4 is the remainder of p modulo 4. (Following R. Israel in A321833.) - M. F. Hasler, Nov 26 2018

MATHEMATICA

s[n_, r_] := DivisorSum[n, #^7 &, Mod[n/#, 4]==r &]; a[n_] := s[n, 1] - s[n, 3]; Array[a, 30] (* Amiram Eldar, Nov 26 2018 *)

PROG

(PARI) apply( A321831(n)=factorback(apply(f->f[1]^(7*f[2]+7)\/(f[1]^7+f[1]%4-2), Col(factor(n)))), [1..30]) \\ M. F. Hasler, Nov 26 2018

CROSSREFS

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

Sequence in context: A283338 A128696 A195594 * A223954 A224138 A331198

Adjacent sequences:  A321828 A321829 A321830 * A321832 A321833 A321834

KEYWORD

nonn,mult

AUTHOR

N. J. A. Sloane, Nov 24 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 25 06:36 EST 2022. Contains 350565 sequences. (Running on oeis4.)