login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A307738 Number of partitions of n^3 into at most n cubes. 2
1, 1, 1, 1, 1, 1, 3, 4, 7, 18, 36, 66, 157, 329, 728, 1611, 3655, 8062, 18154, 40358, 89807, 199778, 444419, 984422, 2183461, 4827756, 10651083, 23465459, 51576034, 113092423, 247546849, 540538832, 1177836149, 2560897979, 5555722749, 12025952101, 25976048200 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,7

COMMENTS

Does a(n+1) / a(n) ~ 2? - David A. Corneth, Sep 27 2019

LINKS

David A. Corneth, Table of n, a(n) for n = 0..100

Index entries for sequences related to sums of cubes

EXAMPLE

7^3 =

1^3 + 1^3 + 5^3 + 6^3 =

1^3 + 1^3 + 3^3 + 4^3 + 5^3 + 5^3 =

1^3 + 2^3 + 3^3 + 3^3 + 4^3 + 6^3,

so a(7) = 4.

PROG

(PARI) a(n) = {my(res = 0); res=aIterate(n^3, 1, n); res }

aIterate(s, m, q) = { if(s == 0, return(1)); if(q == 0, return(0)); sum(i = m, sqrtnint(s, 3), aIterate(s - i^3, i, q-1) ) } \\ David A. Corneth, Sep 23 2019

CROSSREFS

Cf. A000578, A025446-A025454, A030272, A105152, A259792, A298671, A298672, A307643, A307739.

Sequence in context: A041593 A258740 A109749 * A041497 A042227 A117789

Adjacent sequences:  A307735 A307736 A307737 * A307739 A307740 A307741

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, Apr 25 2019

EXTENSIONS

a(21)-a(36) from David A. Corneth, Sep 23 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 15 12:54 EST 2021. Contains 340187 sequences. (Running on oeis4.)