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 A348522 #12 Apr 28 2022 13:35:36
%S A348522 0,0,1,1,1,1,1,1,1,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5,6,6,
%T A348522 6,7,7,7,7,7,8,8,8,9,9,9,9,9,10,10,10,11,11,11,12,12,13,13,13,14,14,
%U A348522 14,15,15,16,17,17,18,18,18,19,19,21,21,21,22,22,22,23,23,25
%N A348522 Number of partitions of n into two or more cubes.
%H A348522 David A. Corneth, <a href="/A348522/b348522.txt">Table of n, a(n) for n = 0..10000</a>
%H A348522 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%o A348522 (PARI)
%o A348522 cubes_less_than(n) = { my(lista=List([]),i=1,k=1); while(k<n, listput(lista,k); i++; k = i^3); Vecrev(Vec(lista)); };
%o A348522 partitions_into_with_trailing_ones(n, parts, from=1) = if(!n, 1, if(#parts<=(from+1), if(#parts == from, 1, (1+(n\parts[from]))), my(s=0); for(i=from, #parts, if(parts[i]<=n, s += partitions_into_with_trailing_ones(n-parts[i], parts, i))); (s)));
%o A348522 A348522(n) = if(n<2,0,partitions_into_with_trailing_ones(n, cubes_less_than(n))); \\ _Antti Karttunen_, Oct 31 2021
%Y A348522 Cf. A000578, A003108, A010057, A219610, A348524.
%K A348522 nonn
%O A348522 0,10
%A A348522 _Ilya Gutkovskiy_, Oct 21 2021