id:A051344 - OEIS Search Results

Search: id:A051344

Displaying 1-1 of 1 results found.

page 1

Number of ways of writing n as a sum of 3 positive cubes (counted naively).

+0
2

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; listen)

	OFFSET	`0,11`
	MAPLE	`series(add(x^(n^3), n=1..10)^3, x, 1000);`
	CROSSREFS	`Cf. A051343.` `Adjacent sequences: A051341 A051342 A051343 this_sequence A051345 A051346 A051347` `Sequence in context: A030121 A062535 A008437 this_sequence A101856 A059484 A035678`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.

AT&T Labs Research