login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A364014
Expansion of Sum_{k>0} x^(2*k) / (1 + x^(3*k)).
4
0, 1, 0, 1, -1, 1, 0, 2, 0, 0, -1, 1, 0, 2, -1, 2, -1, 1, 0, 1, 0, 0, -1, 2, -1, 2, 0, 2, -1, 0, 0, 3, -1, 0, -2, 1, 0, 2, 0, 2, -1, 2, 0, 1, -1, 0, -1, 2, 0, 1, -1, 2, -1, 1, -2, 4, 0, 0, -1, 1, 0, 2, 0, 3, -2, 0, 0, 1, -1, 0, -1, 2, 0, 2, -1, 2, -2, 2, 0, 3, 0, 0, -1, 2, -2, 2, -1, 2, -1, 0, 0, 1, 0, 0, -2, 3, 0
OFFSET
1,8
LINKS
FORMULA
G.f.: Sum_{k>0} (-1)^(k-1) * x^(3*k-1) / (1 - x^(3*k-1)).
a(n) = Sum_{d|n, n/d==2 (mod 3)} (-1)^(n/d) = Sum_{d|n, d==2 (mod 3)} (-1)^d.
MATHEMATICA
a[n_] := DivisorSum[n, (-1)^(n/#) &, Mod[n/#, 3] == 2 &]; Array[a, 100] (* Amiram Eldar, Jul 03 2023 *)
PROG
(PARI) a(n) = sumdiv(n, d, (d%3==2)*(-1)^d);
CROSSREFS
Sequence in context: A147696 A001842 A216654 * A326016 A326033 A029429
KEYWORD
sign
AUTHOR
Seiichi Manyama, Jul 01 2023
STATUS
approved