TITLE: Find all integer solutions to $a+b+c|ab+bc+ca|abc$
QUESTION [8 upvotes]: As you can see from the title, I am trying to find all integer solutions $(a,b,c)$ to $$(a+b+c) \ \lvert\ (ab+bc+ca) \ \lvert\ abc$$ (that is, $a+b+c$ divides $ab+bc+ca$, and $ab+bc+ca$ divides $abc$). Unfortunately, I could not find anything on this problem (although I find it hard to believe that nobody though of this before).
What I've found so far
I have looked at the simpler case: $(a+b) \ \lvert\ ab$. I was able to solve this, and all solutions are $$(a,b)=(\alpha(\alpha+\beta)\gamma,\beta(\alpha+\beta)\gamma)$$ with $\alpha,\beta,\gamma\in\mathbb{Z}$. 
I was also able to reduce the given problem to only one division. If we are able to solve $$(a_0b_0+b_0c_0+c_0a_0) \ \lvert\ (a_0+b_0+c_0)a_0b_0c_0 $$ with $\gcd(a_0,b_0,c_0)=1$, then we know that
\begin{align}
a&=a_0(a_0+b_0+c_0)\cdot k\\
b&=b_0(a_0+b_0+c_0)\cdot k\\
c&=c_0(a_0+b_0+c_0)\cdot k\\
\end{align}
For $k\in\mathbb{Z}$ are all solutions to the original problem. However, I was not able to solve this. I have computed a few solutions to the last (and the corresponding solutions for the original problem) but was not able to find a pattern. Any progress on the problem is welcome!

REPLY [2 votes]: $a,b,c$ are roots of  $X^3-(a+b+c)X^2+(ab+ac+bc)X=abc$.
Putting $$\begin{cases}a+b+c=A\\ab+ac+bc=mA\\abc=n(ab+ac+bc)\end{cases}\qquad (*)$$
one gets $$X^3-AX^2+mAX=mnA$$ it follows
$$\begin{cases}a^3-Aa^2+mAa=mnA\\b^3-Ab^2+mAb=mnA\\c^3-Ac^2+mAc=mnA\end{cases}$$ 
 Hence $a^3\equiv b^3\equiv c^3\pmod A$ so that
$a^3+b^3+c^3=kA$. 
We take a look to the equation $$X^3+Y^3+Z^3=r$$ for cases in which there are solutions and we try to condition these to our problem.
Example.-For $r=s^3$.  $$X^3+Y^3+Z^3= s^3 \Rightarrow (X,Y,Z)=(t,-t,s)$$  To fit with (*) we choose  $t=2s$ which gives $(a,b,c)=(2s,-2s,s)$ so one has $$\begin{cases}a+b+c=2s-2s+s=s\\ab+ac+bc=-4s^2=(-4s)s\\ abc=-4s^3=(-4s^2)s\end{cases}$$ Thus $$a+b+c=s$$ $$\frac{ab+ac+bc}{a+b+c}=-4s$$ $$\frac{abc}{ab+ac+bc}=s$$
I will return to this problem…., if I may.