When does $x^3+y^3=kz^2$? For which integers $k$ does
$$
x^3+y^3=kz^2
$$
have a solution with $z\ne0$ and $\gcd(x,y)=1$? Is there a technique for counting the number of solutions for a given $k$?
 A: $\qquad\qquad$ Too long for a comment: Positive coprime integers x and y less than $6,000$ :

$\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\quad$ $k=1$

$\qquad\qquad\qquad\qquad$ 

$\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\quad$ $k=2$

$\qquad\qquad\qquad\qquad$ 

$\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\quad$ $k=3$

$\qquad\qquad\qquad\qquad$ 

$\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\quad$ $k=4$

$\qquad\qquad\qquad\qquad$ 

$\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\quad$ $k=5$

$\qquad\qquad\qquad\qquad$ 
A: If $k=z$, there are no solution by Fermat's Last Theorem.
When $k=1$ a solution can be $x=1$, $y=2$, $z = 3$, because $1^{3} + 2^{3} = 3^{2}$
Another $k=38$ have a solution can be $x =3$, $y=5$, $z=2$ and there are lots of $k$ can be 
solution of that equation, but now I don't know any technique for count how many or what $k$  give a solution.
EDIT:
I found the following solution, I think it isn't the best but:
\begin{equation}
x^{3}  + y^{3} = (x+y)[(x-y)^{2}+xy]
\end{equation}
we can think that $(x+y) = z^{2}$ and $k =[(x-y)^{2}+xy]$.
now using $xy = \frac{1}{4}[(x+y)^2 - (x-y)^{2}]$
we can found $3$ solutions, 
$1) k =[(x-y)^{2}+xy] \iff x+y$ is a square;
$2) k =[\frac{3}{2}(x-y)^{2}+\frac{(x+y)^2}{2}] \iff \frac{x+y}{2}$ is a square;
$3) k =[3(x-y)^{2}+(x+y)^2] \iff \frac{x+y}{4}$ is a square;
A: Well you can and draw another formula.  $$x^3+y^3=kz^2$$  $$x=k(b^2-a^2)(b^2+2ba-2a^2)c^2$$  $$y=k(b^2-a^2)(2b^2-2ab-a^2)c^2$$  $$z=3k(b^2-a^2)^2(a^2-ab+b^2)c^3$$  
The most interesting thing there is that the formula that led, like should not give mutually simple solutions, but after sokrasheniya on common divisor can be obtained and are relatively prime solutions. This means that the formula itself describes as relatively prime so no. Coprime solutions - there are private solutions.
the equation:    $$(X+1)^3-X^3=Y^2$$  
Solutions can be written if we use the solutions of Pell's equation:  $p^2-3s^2=1$ 
Then the solution can be written:  $$X=\pm2ps-p^2$$  $$Y=p^2\mp3ps+3s^2$$  
If we make the change:  $$q=2ps\pm(p^2+3s^2)$$  $$t=4ps\pm(p^2+3s^2)$$  
Then the solutions are of the form:  $$Y=t^2-tq+q^2$$  $$X=t(t-2q)$$  
If we make the change:  $$t=3ps\pm(p^2+3s^2)$$  $$q=4ps\pm(p^2+3s^2)$$  
Then the solutions are of the form:  $$X=-4t(t+q)$$  $$Y=4t^2+6tq+3q^2$$
There are formulas, but I have to rewrite no time.  You can see it there.
http://www.artofproblemsolving.com/blog/98941
A: A question to achille hui 
"Actually, this result is a byproduct of a more general approach which study the equations over the Eisenstein integers Z[e 2πi/3 ] . For each k , there are finitely many ways to factorize it over Z[e 2πi/3 ]  and for each factorization, the problem can be reduced to the problem of finding a solution for a Diophantine equation on 3 variables."
Achille, do you have any references about this approach? Any published papers? Do you mean QUADRATIC Diophantine equation of 3 variables? Thank you, Vlad 
A: Consider the equation: $$(a+b)^3+(a-b)^3=2a(a^2+3b^2)$$ Now let $a^2+3b^2=c^2$. We want to find a general equation for this. Note that $$(m-n)^2+2mn=(m+n)^2$$ Therefore, substitute $m\mapsto m^2$ and $n\mapsto n^2k$ then $$(m^2-k\cdot n^2)^2+k(2mn)^2=(m^2+k\cdot n^2)^2$$ Let $k=3$, and it follows that $a=m^2-3n^2$ and $b=2mn$, given that $a^2+b^2=(m^2+3n^2)^2$. $$\therefore (m^2-3n^2+2mn)^3+(m^2-3n^2-2mn)^3=2(m^2-3n^2)(m^2+3n^2)^2$$ We could also substitute  $m\to 3m^2$ and $n\mapsto n^2$ to get $$(3m^2-n^2+2mn)^3+(3m^2-n^2-2mn)^3=2(3m^2-n^2)(3m^2+n^2)^2$$
