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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A321819 a(n) = Sum_{d|n, n/d odd} d^10 for n > 0. 3
 1, 1024, 59050, 1048576, 9765626, 60467200, 282475250, 1073741824, 3486843451, 10000001024, 25937424602, 61918412800, 137858491850, 289254656000, 576660215300, 1099511627776, 2015993900450, 3570527693824, 6131066257802, 10240001048576 (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^10*x^k/(1 - x^(2*k)). - Ilya Gutkovskiy, Dec 22 2018 MATHEMATICA a[n_] := DivisorSum[n, #^10 &, OddQ[n/#] &]; Array[a, 30] (* Amiram Eldar, Nov 26 2018 *) PROG (PARI) apply( A321819(n)=sumdiv(n, d, if(bittest(n\d, 0), d^10)), [1..30]) \\ M. F. Hasler, Nov 26 2018 CROSSREFS Cf. A321543 - A321565, A321807 - A321836 for related sequences. Sequence in context: A008454 A030629 A056587 * A231309 A134847 A066371 Adjacent sequences:  A321816 A321817 A321818 * A321820 A321821 A321822 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 October 26 08:06 EDT 2020. Contains 338027 sequences. (Running on oeis4.)