I'm trying to prove that all integer solutions $a > b \ge 0$ to the divisibility condition in the title, namely $$(a^2+b^2+1) \mid 2(2ab+1),$$ are given by $$(a,b)=(1,0),(4,1),(15,4),(56,15),(209,56),\dots$$ where $a_n$ is in http://oeis.org/A001353, and $b_{n+1}=a_n$. This sequence is related to the Pell equation $x^2-3y^2=1$, in that the sequence $0,1,4,15,56,\dots$ give the $y$ values in the solutions $(x,y)$.
Related MSE posts of possible interest include Proving there are an infinite number of pairs of positive integers $(m,n)$ such that $\frac{m+1}{n}+\frac{n+1}{m}$ is a positive integer and Conjecture on integer solutions to the equation $ (ab + 1) \mid (a^{2}+b^{2})$. Vieta jumping doesn't seem to apply (since it's best used to derive a contradiction, or prove a constant value). Any help/pointers would be appreciated.