OFFSET
0,3
COMMENTS
In Watson 1936 the function is denoted by upsilon(q). - Michael Somos, Jul 25 2015
REFERENCES
Srinivasa Ramanujan, The Lost Notebook and Other Unpublished Papers, Narosa Publishing House, New Delhi, 1988, p. 31.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Leila A. Dragonette, Some asymptotic formulas for the mock theta series of Ramanujan, Trans. Amer. Math. Soc., 72 (1952) 474-500.
George N. Watson, The final problem: an account of the mock theta functions, J. London Math. Soc., 11 (1936) 55-80.
FORMULA
G.f.: nu(q) = Sum_{n >= 0} q^(n*(n+1))/((1+q)*(1+q^3)*...*(1+q^(2n+1)))
(-1)^n*a(n) = number of partitions of n in which even parts are distinct and if k occurs then so does every positive even number less than k.
G.f.: 1/(1 + x*(1-x)/(1 + x^2*(1-x^2)/(1 + x^3*(1-x^3)/(1 + x^4*(1-x^4)/(1 + x^5*(1-x^5)/(1 + ...)))))), a continued fraction. - Paul D. Hanna, Jul 09 2013
a(n) ~ (-1)^n * exp(Pi*sqrt(n/6)) / (2^(3/2)*sqrt(n)). - Vaclav Kotesovec, Jun 15 2019
EXAMPLE
G.f. = 1 - x + 2*x^2 - 2*x^3 + 2*x^4 - 3*x^5 + 4*x^6 - 4*x^7 + 5*x^8 + ...
MATHEMATICA
Series[Sum[q^(n(n+1))/Product[1+q^(2k+1), {k, 0, n}], {n, 0, 9}], {q, 0, 100}]
PROG
(PARI) /* Continued Fraction Expansion: */
{a(n)=local(CF); CF=1+x; for(k=0, n, CF=1/(1 + x^(n-k+1)*(1 - x^(n-k+1))*CF+x*O(x^n))); polcoeff(CF, n)} \\ Paul D. Hanna, Jul 09 2013
CROSSREFS
KEYWORD
sign,easy
AUTHOR
Dean Hickerson, Dec 19 1999
STATUS
approved