The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A321818 a(n) = Sum_{d|n, n/d odd} d^8 for n > 0. 3
 1, 256, 6562, 65536, 390626, 1679872, 5764802, 16777216, 43053283, 100000256, 214358882, 430047232, 815730722, 1475789312, 2563287812, 4294967296, 6975757442, 11021640448, 16983563042, 25600065536, 37828630724, 54875873792, 78310985282 (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). FORMULA G.f.: Sum_{k>=1} k^8*x^k/(1 - x^(2*k)). - Ilya Gutkovskiy, Dec 22 2018 PROG (PARI) apply( A321818(n)=sumdiv(n, d, if(bittest(n\d, 0), d^8)), [1..30]) \\ M. F. Hasler, Nov 26 2018 CROSSREFS Cf. A321543 - A321565, A321807 - A321836 for related sequences. Sequence in context: A046457 A179645 A056585 * A231307 A206129 A236214 Adjacent sequences:  A321815 A321816 A321817 * A321819 A321820 A321821 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.

Last modified December 8 21:59 EST 2021. Contains 349596 sequences. (Running on oeis4.)