This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A262811 #17 Sep 08 2017 06:50:24
%S A262811 1,1,1,4,4,9,15,22,37,56,92,133,210,310,466,696,1013,1495,2160,3141,
%T A262811 4495,6462,9172,13024,18387,25840,36213,50500,70280,97302,134522,
%U A262811 185105,254245,347938,475036,646676,878145,1189468,1607095,2166672,2913794,3910741
%N A262811 Expansion of Product_{k>=1} 1/(1-x^(2*k-1))^(2*k-1).
%H A262811 Alois P. Heinz, <a href="/A262811/b262811.txt">Table of n, a(n) for n = 0..10000</a>
%H A262811 Vaclav Kotesovec, <a href="http://arxiv.org/abs/1509.08708">A method of finding the asymptotics of q-series based on the convolution of generating functions</a>, arXiv:1509.08708 [math.CO], Sep 30 2015
%F A262811 a(n) ~ exp(-1/12 + 3*Zeta(3)^(1/3)*n^(2/3)/2) * A * Zeta(3)^(5/36) / (2^(2/3) * sqrt(3*Pi) * n^(23/36)), where Zeta(3) = A002117 and A = A074962 is the Glaisher-Kinkelin constant.
%F A262811 a(0) = 1, a(n) = (1/n)*Sum_{k=1..n} A050999(k)*a(n-k) for n > 0. - _Seiichi Manyama_, Apr 09 2017
%p A262811 with(numtheory):
%p A262811 a:= proc(n) option remember; `if`(n=0, 1, add(add(d*
%p A262811 `if`(d::even, 0, d), d=divisors(j))*a(n-j), j=1..n)/n)
%p A262811 end:
%p A262811 seq(a(n), n=0..45); # _Alois P. Heinz_, Oct 05 2015
%t A262811 nmax = 60; CoefficientList[Series[Product[1/(1-x^(2*k-1))^(2*k-1), {k, 1, nmax}], {x, 0, nmax}], x]
%Y A262811 Cf. A000219, A003293, A035528, A161870, A262736, A292038.
%K A262811 nonn
%O A262811 0,4
%A A262811 _Vaclav Kotesovec_, Oct 03 2015