%I #19 Nov 04 2022 10:47:29
%S 1,-63,730,-4159,15626,-45990,117650,-266303,532171,-984438,1771562,
%T -3036070,4826810,-7411950,11406980,-17043519,24137570,-33526773,
%U 47045882,-64988534,85884500,-111608406,148035890,-194401190,244156251,-304089030,387952660,-489306350,594823322,-718639740,887503682
%N a(n) = Sum_{d|n} (-1)^(d-1)*d^6.
%H Seiichi Manyama, <a href="/A321545/b321545.txt">Table of n, a(n) for n = 1..10000</a>
%H J. W. L. Glaisher, <a href="https://books.google.com/books?id=bLs9AQAAMAAJ&pg=RA1-PA1">On the representations of a number as the sum of two, four, six, eight, ten, and twelve squares</a>, Quart. J. Math. 38 (1907), 1-62 (see p. 4 and p. 8).
%H <a href="/index/Ge#Glaisher">Index entries for sequences mentioned by Glaisher</a>.
%F G.f.: Sum_{k>=1} (-1)^(k-1)*k^6*x^k/(1 - x^k). - _Ilya Gutkovskiy_, Dec 23 2018
%F Multiplicative with a(2^e) = 2 - (2^(6*e + 6) - 1)/63, and a(p^e) = (p^(6*e + 6) - 1)/(p^6 - 1) for p > 2. - _Amiram Eldar_, Nov 04 2022
%t f[p_, e_] := (p^(6*e + 6) - 1)/(p^6 - 1); f[2, e_] := 2 - (2^(6*e + 6) - 1)/63; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 30] (* _Amiram Eldar_, Nov 04 2022 *)
%o (PARI) apply( a(n)=sumdiv(n, d, (-1)^(d-1)*d^6), [1..30]) \\ _M. F. Hasler_, Nov 26 2018
%Y Cf. A321543 - A321565, A321807 - A321836 for similar sequences.
%K sign,mult
%O 1,2
%A _N. J. A. Sloane_, Nov 23 2018