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!)
A321835 a(n) = Sum_{d|n, n/d==1 mod 4} d^11 - Sum_{d|n, n/d==3 mod 4} d^11. 4
1, 2048, 177146, 4194304, 48828126, 362795008, 1977326742, 8589934592, 31380882463, 100000002048, 285311670610, 743004176384, 1792160394038, 4049565167616, 8649707208396, 17592186044416, 34271896307634, 64268047284224, 116490258898218 (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^11*x^k/(1 + x^(2*k)). - Ilya Gutkovskiy, Nov 26 2018

MATHEMATICA

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

PROG

(PARI) apply( a(n)=sumdiv(n, d, if(bittest(n\d, 0), (2-n\d%4)*d^11)), [1..30]) \\ M. F. Hasler, Nov 26 2018

CROSSREFS

Cf. A321807 - A321836 for related sequences.

Sequence in context: A100629 A247934 A195659 * A017686 A008455 A079395

Adjacent sequences:  A321832 A321833 A321834 * A321836 A321837 A321838

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 August 5 18:00 EDT 2021. Contains 346488 sequences. (Running on oeis4.)