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!)
A051344 Number of ways of writing n as a sum of 3 positive cubes (counted naively). 10
0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,11

LINKS

Table of n, a(n) for n=0..92.

MAPLE

series(add(x^(n^3), n=1..10)^3, x, 1000);

CROSSREFS

Cf. A051343.

Sequence in context: A151755 A325739 A181004 * A236534 A101856 A335520

Adjacent sequences: A051341 A051342 A051343 * A051345 A051346 A051347

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

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 January 27 09:05 EST 2023. Contains 359838 sequences. (Running on oeis4.)