Pigeonhole and Extremal Arguments · Challenge problem

Integer solutions of $x^2 + y^2 + z^2 = 2xyz$: the sum of the three squares is even, and a mod $4$ argument shows all three must be even, so halving gives another solution. How many integer triples with $|x|, |y|, |z| \le 30$ satisfy the equation?