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 A334626 #21 Dec 05 2020 14:42:50
%S A334626 1,1,1,1,1,1,1,1,2,2,3,4,6,8,12,16,23,30,41,53,71,90,117,147,187,231,
%T A334626 289,354,436,528,642,770,927,1102,1313,1550,1832,2147,2519,2935,3421,
%U A334626 3964,4594,5298,6110,7016,8055,9216,10542,12021,13706,15588,17724,20111
%N A334626 G.f.: Sum_{k>=0} x^(k^3) / Product_{j=1..k^3} (1 - x^j).
%C A334626 Number of partitions of n such that the number of parts is a cube.
%C A334626 Also number of partitions of n such that the largest part is a cube.
%H A334626 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%e A334626 a(10) = 3 because we have [10], [3, 1, 1, 1, 1, 1, 1, 1] and [2, 2, 1, 1, 1, 1, 1, 1] (see the first comment) or [8, 2], [8, 1, 1] and [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] (see the second comment).
%t A334626 nmax = 53; CoefficientList[Series[Sum[x^(k^3)/Product[1 - x^j, {j, 1, k^3}], {k, 0, Floor[nmax^(1/3)] + 1}], {x, 0, nmax}], x]
%Y A334626 Cf. A000578, A003108, A089333, A280351, A339235.
%K A334626 nonn
%O A334626 0,9
%A A334626 _Ilya Gutkovskiy_, Dec 05 2020