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 A298848 #4 Jan 28 2018 11:02:05
%S A298848 1,0,1,1,1,1,2,1,1,1,1,1,3,2,5,4,3,4,13,11,15,20,23,34,52,49,97,118,
%T A298848 164,192,296,330,525,745,825,1354,1820,1994,3356,4605,5543,8335,12319,
%U A298848 13124,21133,28634,33209,51272,71154,85329,126806,174704,210157,310269,433490,511199
%N A298848 Number of partitions of n^3 into distinct cubes > 1.
%H A298848 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%H A298848 <a href="/index/Par#part">Index entries for related partition-counting sequences</a>
%F A298848 a(n) = [x^(n^3)] Product_{k>=2} (1 + x^(k^3)).
%F A298848 a(n) = A280130(A000578(n)).
%e A298848 a(6) = 2 because we have [216] and [125, 64, 27].
%Y A298848 Cf. A000578, A003108, A030272, A078128, A259792, A279329, A280130, A298641, A298671, A298672.
%K A298848 nonn
%O A298848 0,7
%A A298848 _Ilya Gutkovskiy_, Jan 27 2018