|
|
A071006
|
|
Number of positive solutions to the Diophantine equation x^2+y^3=n^2 with y <= x.
|
|
1
|
|
|
0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 2, 0, 1, 0, 0, 1, 0, 1, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,55
|
|
LINKS
|
|
|
MAPLE
|
f:= proc(n) local t, v, y;
t:= 0:
for y from 1 do
v:= n^2 - y^3;
if v < y^2 then return t fi;
if issqr(v) then t:= t+1 fi
od
end proc:
|
|
PROG
|
(PARI) for(n=1, 100, print1(sum(i=1, n, sum(j=1, i, if(i^2+j^3-n^2, 0, 1))), ", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|