OFFSET
0,6
COMMENTS
Let U(k,q) = 1/((q^2;q)_k * (q^2;q^2)_k). The naive alternating sum Sum_{n>=0} (-1)^n * U(n,q) diverges since U(k,q) -> 1/((q^2;q)_inf * (q^2;q^2)_inf) != 0. The even and odd partial sums converge to different limits differing by 1/((q^2;q)_inf * (q^2;q^2)_inf). A(q) is defined as the even partial-sum limit.
All terms appear to be nonnegative (verified for n <= 10000).
LINKS
Alejandro Radisic, Table of n, a(n) for n = 0..500
FORMULA
G.f.: A(q) = lim_{M->inf} Sum_{n=0..2M} (-1)^n U(n,q), where U(k,q) = 1/(Product_{j=0..k-1} (1-q^(j+2)) * Product_{j=0..k-1} (1-q^(2*j+2))).
Equivalent: A(q) = 1/((q^2;q)_inf*(q^2;q^2)_inf) + Sum_{m>=0} (U(2m,q) - U(2m+1,q)).
Conjectured from n <= 10000: log(a(n)) = Pi*sqrt(n) - (7/4)*log(n) + C + O(n^(-1/2)), C ~ -2.34.
Conjectured: a(n) ~ (Pi/4)*b(n)/sqrt(n), where b(n) = A002513(n).
EXAMPLE
A(q) = 1 + q^3 + q^4 + 3*q^5 + 3*q^6 + 7*q^7 + 8*q^8 + 15*q^9 + ...
PROG
(Python)
def a_list(nmax):
K = 2 * nmax + 2
c = [0] * (nmax + 1)
t = [0] * (nmax + 1)
t[0] = 1
for k in range(K + 1):
s = -1 if (k & 1) else 1
for j in range(nmax + 1):
c[j] += s * t[j]
m1 = k + 2
if m1 <= nmax:
for j in range(m1, nmax + 1):
t[j] += t[j - m1]
m2 = 2 * (k + 1)
if m2 <= nmax:
for j in range(m2, nmax + 1):
t[j] += t[j - m2]
return c
print(a_list(47))
CROSSREFS
KEYWORD
nonn
AUTHOR
Alejandro Radisic, Feb 23 2026
STATUS
approved
