The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A321828 a(n) = Sum_{d|n, d==1 mod 4} d^12 - Sum_{d|n, d==3 mod 4} d^12. 4
 1, 1, -531440, 1, 244140626, -531440, -13841287200, 1, 282429005041, 244140626, -3138428376720, -531440, 23298085122482, -13841287200, -129746094281440, 1, 582622237229762, 282429005041, -2213314919066160, 244140626, 7355813669568000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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 a(n) = a(A000265(n)). - M. F. Hasler, Nov 26 2018 G.f.: Sum_{k>=1} (-1)^(k-1)*(2*k - 1)^12*x^(2*k-1)/(1 - x^(2*k-1)). - Ilya Gutkovskiy, Dec 22 2018 MATHEMATICA s[n_, r_] := DivisorSum[n, #^12 &, Mod[#, 4] == r &]; a[n_] := s[n, 1] - s[n, 3]; Array[a, 30] (* Amiram Eldar, Nov 26 2018 *) PROG (PARI) apply( A321828(n)=sumdiv(n>>valuation(n, 2), d, (2-d%4)*d^12), [1..40]) \\ M. F. Hasler, Nov 26 2018 CROSSREFS Column k=12 of A322143. Cf. A321543 - A321565, A321807 - A321836 for similar sequences. Sequence in context: A340304 A364903 A210352 * A038682 A017082 A017166 Adjacent sequences: A321825 A321826 A321827 * A321829 A321830 A321831 KEYWORD sign,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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 26 20:30 EDT 2023. Contains 365668 sequences. (Running on oeis4.)