OFFSET
0,15
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..10000
FORMULA
Euler transform of period 30 sequence [ -1, -1, -1, -1, -1, 0, -1, -1, -1, 0, -1, 0, -1, -1, -2, -1, -1, 0, -1, 0, -1, -1, -1, 0, -1, -1, -1, -1, -1, 0, ...].
G.f. A(x) satisfies 0 = f(A(x), A(x^2)) where f(u, v) = v*(u^2 - v) - 2 * u * (u-1).
G.f. is a period 1 Fourier series which satisfies f(-1 / (30 t)) = 2 * g(t) where q = exp(2 Pi i t) and g() is the g.f. for A094022.
G.f.: Product_{k>0} (1 - x^k) * (1 - x^(15*k)) / ((1 - x^(6*k)) * (1 - x^(10*k))).
Convolution inverse of A094023.
a(n) = (-1)^n * A145727(n). - Michael Somos, Nov 11 2015
EXAMPLE
G.f. = 1 - q - q^2 + q^5 + q^6 - q^8 + q^10 - q^13 - 2*q^14 - q^15 + 2*q^16 + ...
MATHEMATICA
a[ n_] := SeriesCoefficient[ QPochhammer[ q] QPochhammer[ q^15] / (QPochhammer[ q^6] QPochhammer[ q^10]), {q, 0, n}]; (* Michael Somos, Aug 26 2015 *)
PROG
(PARI) {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A) * eta(x^15 + A) / (eta(x^6 + A) * eta(x^10 + A)), n))};
CROSSREFS
KEYWORD
sign
AUTHOR
Michael Somos, Jul 16 2007
STATUS
approved