|
|
A025455
|
|
a(n) is the number of partitions of n into 2 positive cubes.
|
|
8
|
|
|
0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1730
|
|
COMMENTS
|
In other words, number of solutions to the equation x^3 + y^3 = n with x >= y > 0. - Antti Karttunen, Aug 28 2017
|
|
LINKS
|
|
|
FORMULA
|
a(n) = [x^n y^2] Product_{k>=1} 1/(1 - y*x^(k^3)). - Ilya Gutkovskiy, Apr 23 2019
|
|
MATHEMATICA
|
Table[Count[IntegerPartitions[n, {2}], _?(AllTrue[Surd[#, 3], IntegerQ]&)], {n, 0, 110}] (* Harvey P. Dale, Nov 23 2022 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|