login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A321554 a(n) = Sum_{d|n} (-1)^(n/d+1)*d^9. 4
1, 511, 19684, 261631, 1953126, 10058524, 40353608, 133955071, 387440173, 998047386, 2357947692, 5149944604, 10604499374, 20620693688, 38445332184, 68584996351, 118587876498, 197981928403, 322687697780, 510998308506, 794320419872, 1204911270612, 1801152661464, 2636771617564, 3814699218751 (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^9*x^k/(1 + x^k). - Seiichi Manyama, Nov 24 2018

PROG

(PARI) apply( A321554(n)=sumdiv(n, d, (-1)^(n\d-1)*d^9), [1..30]) \\ M. F. Hasler, Nov 26 2018

CROSSREFS

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

Sequence in context: A069094 A024007 A258810 * A321548 A160956 A022191

Adjacent sequences:  A321551 A321552 A321553 * A321555 A321556 A321557

KEYWORD

nonn,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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 14:38 EST 2019. Contains 329865 sequences. (Running on oeis4.)