This site is supported by donations to The OEIS Foundation.

 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!)
 A321820 a(n) = Sum_{d|n, n/d odd} d^12 for n > 0. 3
 1, 4096, 531442, 16777216, 244140626, 2176786432, 13841287202, 68719476736, 282430067923, 1000000004096, 3138428376722, 8916117225472, 23298085122482, 56693912379392, 129746582562692, 281474976710656, 582622237229762, 1156833558212608 (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^12*x^k/(1 - x^(2*k)). - Ilya Gutkovskiy, Dec 22 2018 PROG (PARI) apply( A321820(n)=sumdiv(n, d, if(bittest(n\d, 0), d^12)), [1..30]) \\ M. F. Hasler, Nov 26 2018 CROSSREFS Cf. A321543 - A321565, A321807 - A321836 for related sequences. Sequence in context: A017688 A008456 A030631 * A236218 A016962 A224395 Adjacent sequences:  A321817 A321818 A321819 * A321821 A321822 A321823 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 16 03:14 EST 2019. Contains 330013 sequences. (Running on oeis4.)