OFFSET
0,9
REFERENCES
Srinivasa Ramanujan, Collected Papers, Chelsea, New York, 1962, pp. 354-355.
Srinivasa Ramanujan, The Lost Notebook and Other Unpublished Papers, Narosa Publishing House, New Delhi, 1988, pp. 20, 22, 23, 25.
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 0..10000 (terms 0..1000 from G. C. Greubel)
George E. Andrews, The fifth and seventh order mock theta functions, Trans. Amer. Math. Soc., 293 (1986) 113-134.
George E. Andrews and Frank G. Garvan, Ramanujan's "lost" notebook VI: The mock theta conjectures, Advances in Mathematics, 73 (1989) 242-255.
George N. Watson, The mock theta functions (2), Proc. London Math. Soc., series 2, 42 (1937) 274-304.
FORMULA
G.f.: F_0(q) = Sum_{n>=0} q^(2n^2)/((1-q)(1-q^3)...(1-q^(2n-1))).
a(n) is the number of partitions of n into odd parts, each of which occurs at least twice, such that if k occurs then all smaller positive odd numbers occur.
a(n) ~ exp(Pi*sqrt(2*n/15)) / (2^(3/2)*5^(1/4)*sqrt(phi*n)), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - Vaclav Kotesovec, Jun 12 2019
MATHEMATICA
Series[Sum[q^(2n^2)/Product[1-q^(2k+1), {k, 0, n-1}], {n, 0, 7}], {q, 0, 100}]
nmax = 100; CoefficientList[Series[Sum[x^(2*k^2) / Product[1-x^(2*j+1), {j, 0, k-1}], {k, 0, Floor[Sqrt[nmax/2]]}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jun 12 2019 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Dean Hickerson, Dec 19 1999
STATUS
approved