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!)
A321827 a(n) = Sum_{d|n, d==1 (mod 4)} d^11 - Sum_{d|n, d==3 (mod 4)} d^11. 3
1, 1, -177146, 1, 48828126, -177146, -1977326742, 1, 31380882463, 48828126, -285311670610, -177146, 1792160394038, -1977326742, -8649707208396, 1, 34271896307634, 31380882463, -116490258898218, 48828126, 350275523038332, -285311670610 (list; graph; refs; listen; history; text; internal format)
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)^11*x^(2*k-1)/(1 - x^(2*k-1)). - Ilya Gutkovskiy, Dec 06 2018

MATHEMATICA

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

PROG

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

CROSSREFS

Column k=11 of A322143.

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

Sequence in context: A280447 A205177 A205276 * A016763 A016775 A016847

Adjacent sequences:  A321824 A321825 A321826 * A321828 A321829 A321830

KEYWORD

sign,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 September 21 02:29 EDT 2020. Contains 337266 sequences. (Running on oeis4.)