login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A374707 Number of distinct sums i^3 + j^3 for 0<=i<=j<=n. 3
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78, 90, 104, 119, 135, 151, 169, 188, 208, 229, 251, 274, 298, 322, 348, 375, 402, 431, 461, 492, 524, 556, 590, 623, 659, 695, 733, 772, 811, 851, 893, 936, 980, 1025, 1071, 1118, 1166, 1213, 1263, 1314, 1365, 1418, 1471, 1525, 1580, 1637, 1695, 1753 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
PROG
(PARI) a(n) = my(v=vector(2*n^3+1)); for(i=0, n, for(j=i, n, v[i^3+j^3+1]+=1)); sum(i=1, #v, v[i]>0);
CROSSREFS
Sequence in context: A033444 A061791 A268291 * A105336 A130910 A105337
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jul 17 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 20 23:09 EDT 2024. Contains 375341 sequences. (Running on oeis4.)