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 A369571 #13 Jan 28 2024 09:01:05
%S A369571 1,2,2,3,4,5,7,9,12,16,20,25,31,38,47,58,70,84,102,122,145,173,205,
%T A369571 242,285,334,391,458,534,620,720,833,961,1109,1276,1466,1683,1926,
%U A369571 2201,2513,2863,3258,3704,4203,4763,5394,6098,6885,7768,8752,9850,11076,12439
%N A369571 Expansion of Product_{k>=1} (1 + x^(k^3)) * (1 + x^k).
%C A369571 Convolution of A279329 and A000009.
%C A369571 a(n) is the number of pairs (Q(k), P(n-k)), 0<=k<=n, where Q(k) is a partition of k into distinct cubes and P(n-k) is a partition of n-k into distinct parts.
%H A369571 Vaclav Kotesovec, <a href="/A369571/b369571.txt">Table of n, a(n) for n = 0..10000</a>
%H A369571 Vaclav Kotesovec, <a href="/A369571/a369571.jpg">Graph - the asymptotic ratio (100000 terms)</a>
%F A369571 a(n) ~ exp(Pi*sqrt(n/3) + (2^(1/3) - 1) * Gamma(1/3) * zeta(4/3) * n^(1/6) / (3^(5/6) * Pi^(1/3))) / (2^(5/2) * 3^(1/4) * n^(3/4)).
%t A369571 nmax = 100; CoefficientList[Series[Product[(1+x^(k^3))*(1+x^k), {k, 1, nmax}], {x, 0, nmax}], x]
%Y A369571 Cf. A000009, A279329, A280278, A280277.
%K A369571 nonn
%O A369571 0,2
%A A369571 _Vaclav Kotesovec_, Jan 26 2024