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 A304021 #12 May 05 2018 02:40:42
%S A304021 1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,
%T A304021 0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,1,1,0,0,
%U A304021 0,0,1,1,1,1,0,0,0,0,0,0,1,2,1,0,0,0,0,0,0,1
%N A304021 Number of partitions of n into at most 1 copy of 1^3, 2 copies of 2^3, 3 copies of 3^3, ... .
%H A304021 Seiichi Manyama, <a href="/A304021/b304021.txt">Table of n, a(n) for n = 0..5000</a>
%F A304021 G.f.: Product_{k>=1} (1-x^(k^3*(k+1)))/(1-x^(k^3)).
%e A304021 n | | a(n)
%e A304021 -----+--------------------+------
%e A304021 1 | 1 | 1
%e A304021 8 | 8 | 1
%e A304021 9 | 8+1 | 1
%e A304021 16 | 8+8 | 1
%e A304021 17 | 8+8+1 | 1
%e A304021 27 | 27 | 1
%e A304021 28 | 27+1 | 1
%e A304021 35 | 27+8 | 1
%e A304021 36 | 27+8+1 | 1
%e A304021 43 | 27+8+8 | 1
%e A304021 ...
%e A304021 81 | 64+8+8+1, 27+27+27 | 2
%Y A304021 Cf. A303942, A304002.
%K A304021 nonn
%O A304021 0,82
%A A304021 _Seiichi Manyama_, May 04 2018