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 A363738 #19 Jun 20 2023 10:02:44 %S A363738 1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,1,0, %T A363738 0,2,0,0,0,0,1,0,0,3,0,0,0,0,1,0,0,4,0,0,1,0,1,0,0,5,0,0,3,0,2,0,0,6, %U A363738 0,0,6,0,3,0,0,7,0,0,10,0,4,1,0,8,0,0,15,0,5,4,0,11,0,0,21,0,6,10,0,16,0,0,28,0,7,20,0,23 %N A363738 Number of ordered partitions of n into cubes > 1. %C A363738 This sequence is different from A278929. %H A363738 Seiichi Manyama, <a href="/A363738/b363738.txt">Table of n, a(n) for n = 0..10000</a> %F A363738 G.f.: 1/(1 - Sum_{k>=2} x^(k^3)). %F A363738 a(0) = 1; a(n) = Sum_{k=2..n} A010057(k) * a(n-k). %e A363738 a(43) = 3 because we have [27, 8, 8], [8, 27, 8] and [8, 8, 27]. %o A363738 (PARI) a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=sum(j=2, i, ispower(j, 3)*v[i-j+1])); v; %Y A363738 Cf. A000578, A010057, A023358, A278929, A280542. %K A363738 nonn %O A363738 0,36 %A A363738 _Seiichi Manyama_, Jun 18 2023