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 A292560 #12 Sep 20 2017 15:22:28
%S A292560 1,-1,1,-1,1,-1,1,-1,0,0,0,0,0,0,0,0,1,-1,1,-1,1,-1,1,-1,0,0,0,-1,1,
%T A292560 -1,1,-1,2,-2,2,-1,1,-1,1,-1,0,0,0,-1,1,-1,1,-1,2,-2,2,-1,1,-1,2,-2,1,
%U A292560 -1,1,-2,2,-2,1,-1,1,-1,1,0,0,0,1,-1,1,-1,1,-2,2,-2,1,-1,1,-2,2,-1,1,-1,2,-2,2,-1,1
%N A292560 Expansion of Product_{k>=1} 1/(1 + x^(k^3)).
%C A292560 Convolution inverse of A279329.
%C A292560 The difference between the number of partitions of n into an even number of cubes and the number of partitions of n into an odd number of cubes.
%C A292560 In general, if m > 0 and g.f. = Product_{k>=1} 1/(1 + x^(k^m)), then a(n) ~ (-1)^n * exp((m+1) * (Gamma(1/m) * Zeta(1 + 1/m) / m^2)^(m/(m+1)) * n^(1/(m+1)) / 2) * (Gamma(1/m) * Zeta(1 + 1/m))^(m/(2*(m+1))) / (sqrt(Pi*(m+1)) * 2^((m+1)/2) * m^((m-1)/(2*(m+1))) * n^((2*m+1)/(2*(m+1)))). - _Vaclav Kotesovec_, Sep 19 2017
%H A292560 Vaclav Kotesovec, <a href="/A292560/b292560.txt">Table of n, a(n) for n = 0..20000</a>
%H A292560 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%H A292560 <a href="/index/Par#part">Index entries for related partition-counting sequences</a>
%F A292560 G.f.: Product_{k>=1} 1/(1 + x^(k^3)).
%F A292560 a(n) ~ (-1)^n * exp(2 * (Gamma(1/3) * Zeta(4/3))^(3/4) * n^(1/4) / 3^(3/2)) * (Gamma(1/3) * Zeta(4/3))^(3/8) / (8 * 3^(1/4) * sqrt(Pi) * n^(7/8)). - _Vaclav Kotesovec_, Sep 19 2017
%t A292560 nmax = 100; CoefficientList[Series[Product[1/(1 + x^(k^3)), {k, 1, Floor[nmax^(1/3)] + 1}], {x, 0, nmax}], x]
%Y A292560 Cf. A081362 (m=1), A292520 (m=2).
%Y A292560 Cf. A003108, A279329, A279484.
%K A292560 sign
%O A292560 0,33
%A A292560 _Ilya Gutkovskiy_, Sep 19 2017