login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A374710
Number of distinct sums i^3 + j^3 + k^3 for 0<=i<=j<=k<=n.
2
1, 4, 10, 20, 35, 56, 82, 117, 162, 215, 279, 352, 426, 528, 645, 772, 899, 1057, 1235, 1429, 1647, 1883, 2133, 2415, 2694, 3022, 3374, 3721, 4130, 4564, 5011, 5503, 5986, 6531, 7045, 7664, 8273, 8945, 9659, 10383, 11127, 11949, 12809, 13713, 14649, 15633, 16644, 17715, 18735, 19916
OFFSET
0,2
PROG
(PARI) a(n) = my(v=vector(3*n^3+1)); for(i=0, n, for(j=i, n, for(k=j, n, v[i^3+j^3+k^3+1]+=1))); sum(i=1, #v, v[i]>0);
CROSSREFS
Cf. A034966.
Sequence in context: A138778 A301244 A038409 * A347252 A201722 A352208
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jul 17 2024
STATUS
approved