OFFSET
1,3
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
FORMULA
Euler transform of period 18 sequence [ -1, -2, -1, -2, -1, -1, -1, -2, 0, -2, -1, -1, -1, -2, -1, -2, -1, -2, ...].
Moebius transform is period 18 sequence [1, -2, -3, 2, -1, 6, 1, -2, 0, 2, -1, -6, 1, -2, 3, 2, -1, 0, ...].
Multiplicative with a(2^e) = (-1)^e, a(3^e) = -2 if e>0, a(p^e) = e+1 if p == 1 (mod 6), a(p^e) = (1+(-1)^e)/2 if p == 5 (mod 6).
G.f.: Sum_{k>0} Kronecker(-3, k) x^k(1-x^(2k))^2/(1-x^(6k)) = x Product_{k>0} (1-x^k)(1-x^(2k))(1+x^(9k))(1+x^(6k)+x^(12k)).
a(3n) = -2*A092829(n). a(3n+1) = A093829(3n+1) = A033687(n). a(3n+2) = A093829(3n+2). a(6n)/2 = A093829(n). a(6n+1) = A097195(n). a(6n+3) = -2*A033762(n). a(6n+5) = 0.
Sum_{k=1..n} abs(a(k)) ~ c * n, where c = 2*Pi/(3*sqrt(3)) = 1.209199... (A248897). - Amiram Eldar, Jan 23 2024
MATHEMATICA
QP = QPochhammer; s = QP[q]*QP[q^2]*(QP[q^18]^2/(QP[q^6]*QP[q^9])) + O[q]^100; CoefficientList[s, q] (* Jean-François Alcover, Nov 25 2015 *)
f[p_, e_] := If[Mod[p, 6] == 1, e+1, (1+(-1)^e)/2]; f[2, e_] := (-1)^e; f[3, e_]:= -2; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Jan 28 2024 *)
PROG
(PARI) {a(n)=if(n<1, 0, if(n%3==0, n/=3; -2, 1)* sumdiv(n, d, kronecker(-12, d) -if(d%2==0, 2*kronecker(-3, d/2))))}
(PARI) {a(n)=local(A); if (n<1, 0, n--; A=x*O(x^n); polcoeff( eta(x+A)*eta(x^2+A)*eta(x^18+A)^2/ eta(x^6+A)/eta(x^9+A), n))}
CROSSREFS
KEYWORD
sign,mult
AUTHOR
Michael Somos, Sep 22 2005
STATUS
approved