|
|
A175365
|
|
Number of integer triples (x,y,z) satisfying |x|^3 + |y|^3 + |z|^3 = n, -n <= x,y,z <= n.
|
|
5
|
|
|
1, 6, 12, 8, 0, 0, 0, 0, 6, 24, 24, 0, 0, 0, 0, 0, 12, 24, 0, 0, 0, 0, 0, 0, 8, 0, 0, 6, 24, 24, 0, 0, 0, 0, 0, 24, 48, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 24, 0, 0, 0, 0, 0, 0, 24, 0, 6, 24, 24, 0, 0, 0, 0, 0, 24, 48, 0, 0, 0, 0, 0, 0, 24, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 48, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
A three-dimensional variant of A175362.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: ( 1 + 2*Sum_{j>=1} x^(j^3) )^3.
|
|
EXAMPLE
|
a(2) = 12 counts (x,y,z) = (-1,-1,0), (-1,0,-1), (-1,0,1), (-1,1,0), (0,-1,-1), (0,-1,1), (0,1,-1), (0,1,1), (1,-1,0), (1,0,-1), (1,0,1) and (1,1,0).
|
|
MAPLE
|
N:= 100: # to get a(0) to a(N)
G:= (1+2*add(x^(j^3), j=1..floor(N^(1/3))))^3:
S:= series(G, x, N+1):
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) a(n, k=3) = if(n==0, return(1)); if(k <= 0, return(0)); if(k == 1, return(ispower(n, 3))); my(count = 0); for(v = 0, sqrtnint(n, 3), count += (2 - (v == 0))*if(k > 2, a(n - v^3, k-1), if(ispower(n - v^3, 3), 2 - (n - v^3 == 0), 0))); count; \\ Daniel Suteu, Aug 15 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|