|
|
A078128
|
|
Number of ways to write n as sum of cubes>1.
|
|
13
|
|
|
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 2, 0, 0, 1, 0, 0, 1, 0, 2, 0, 0, 1, 0, 0, 1, 0, 2, 1, 0, 1, 0, 0, 1, 0, 2, 1, 0, 2, 0, 0, 1, 0, 2, 1, 0, 2, 0, 0, 1, 0, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,64
|
|
COMMENTS
|
Conjecture (lower bound): for all k exists b(k) such that a(n)>k for n>b(k); see b(0)=A078129(83)=154 and b(1)=A078130(63)=218.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 1/n*Sum_{k=1..n} (b(k)-1)*a(n-k), a(0) = 1, where b(k) is sum of cube divisors of k. - Vladeta Jovovic, Nov 20 2002
a(n) ~ exp(4*(Gamma(1/3) * Zeta(4/3))^(3/4) * n^(1/4) / 3^(3/2)) * (Gamma(1/3) * Zeta(4/3))^(3/2) / (8 * 3^(5/2) * Pi^2 * n^2).
(End)
|
|
EXAMPLE
|
a(160)=4: 160 = 20*2^3 = 4^3+12*2^3 = 2*4^3+4*2^3 = 5^3+3^3+2^3.
|
|
MATHEMATICA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|