In looking at solutions for the currently occuring 3x3-magic-squares-of-squares problem I ran into the question how I can parametrize $$ a^2 + 2b^2 = c^2 $$ where $a,b,c$ are parametrizable like in the problem of finding all pythagorean triples, where we have $ a=f(n,m),b=f(n,m),c=f(n,m) $ with $n,m \in \Bbb N$ with few additional conditions on $n,m$ like coprimality (I've just looked at the wikipedia entry for pythagorean triples).
I've at the moment not even an idea for an ansatz to that question, but because I'll have later the problem of getting three square terms on the lhs, I'd like to get help for an initial idea, how to approach that. (Surely I could try pattern-detection based on long lists of examples, but possibly this is essentially easy...)
Just for a bit more background: the final problem for me is, to find a solution in squares in a set of three or four term equations of quadratics - or to arrive at that there is no solution possible. Basic condition: all unknowns must be different.
The first two three-term-equations can be solved by the asked parametrization of $-2e^2+1i^2=a^2$ and $-2e^2+1h^2=b^2$ where of course the $e$ are meant to be equal, and to have different solutions for $a$ and $b$ the unknown $e$ must have a structure of $2nm =2n'm'$ where $n \ne n'$ , so must contain at least 3 primefactors. Here is the set of equations:
$$\small \begin{array}{r} e²&h²&i²&&&\\ *&*&*&&&\\ \hline -2&0&1&&=&a²&& \text{three-term equations}\\ -2&1&0&&&b²\\ \hline -1&1&1&&=&c²&& \text{four-term equations}\\ -2&1&2&&&d²\\ 4&-1&-2&&&f²\\ 3&-1&-1&&&g²\\ \end{array}$$