|
|
A321827
|
|
a(n) = Sum_{d|n, d==1 (mod 4)} d^11 - Sum_{d|n, d==3 (mod 4)} d^11.
|
|
3
|
|
|
1, 1, -177146, 1, 48828126, -177146, -1977326742, 1, 31380882463, 48828126, -285311670610, -177146, 1792160394038, -1977326742, -8649707208396, 1, 34271896307634, 31380882463, -116490258898218, 48828126, 350275523038332, -285311670610
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Sum_{k>=1} (-1)^(k-1)*(2*k - 1)^11*x^(2*k-1)/(1 - x^(2*k-1)). - Ilya Gutkovskiy, Dec 06 2018
Multiplicative with a(2^e) = 1, and for an odd prime p, ((p^11)^(e+1)-1)/(p^11-1) if p == 1 (mod 4) and ((-p^11)^(e+1)-1)/(-p^11-1) if p == 3 (mod 4). - Amiram Eldar, Sep 27 2023
|
|
MATHEMATICA
|
s[n_, r_] := DivisorSum[n, #^11 &, Mod[#, 4] == r &]; a[n_] := s[n, 1] - s[n, 3]; Array[a, 30] (* Amiram Eldar, Nov 26 2018 *)
f[p_, e_] := If[Mod[p, 4] == 1, ((p^11)^(e+1)-1)/(p^11-1), ((-p^11)^(e+1)-1)/(-p^11-1)]; f[2, e_] := 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 60] (* Amiram Eldar, Sep 27 2023 *)
|
|
PROG
|
(PARI) apply( A321828(n)=sumdiv(n>>valuation(n, 2), d, (2-d%4)*d^11), [1..40]) \\ M. F. Hasler, Nov 26 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,easy,mult
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|