Can the positive integer solutions to $$ k^2m^2 -k^2 - m^2 +1 = n^2 $$ be characterized (in the sense that the solutions to $a^2+b^2 = c^2$ are characterized by $a=r^2-s^2, b=2rs, c=r^2+s^2$ with $(r,s)=1$ and $r\neq s \mod 2$)?
Beyond than the obvious solutions with one of $k=m$, the seqeunce of solutions for $k=2$ starts with $m = 2, 7, 26, 97, 362 \ldots$; for $k=3$ it starts with $m=3, 17, 99, 373, \ldots$ and for $k=4$ it starts with $m=4, 31, 244, 307 \ldots$
Being a 4-th order Diophantine equation, this may be hard; but the form is so simple that I have hopes. I suspect the set of solutions is infinite, and that (much stronger) even for a given value of $k$ there are infinite solutions, but I don't know how to go about proving either of these.
We can characterize all solutions, and show that there exist infinitely many for all $k\neq 0$.
Fix $k$, and write $k^2-1 = a^2b$, where $b$ is square-free, so our equation becomes $a^2 b (m^2-1)=n^2$. Then $n^2 \equiv 0 \pmod{a^2 b}$, so $ab \mid n$.
Setting $t=\frac{n}{ab}$, we can rewrite our equation as $m^2-bt^2=1$, which is a Pell's equation known to have infinitely many solutions (note: $b\neq 1$, because $k^2-1$ cannot be a square). There are many known descriptions of these solutions, any of which give a complete characterization of the solutions to your equation for fixed $k$.