Put A=a−1 and the equation becomes A(2 A+1)=b(3 b+1). Let d be the greatest common divisor of A and b. Put A=dx,b=dy. Then x(2dx+1)=y(3dy+1). Since x and y are coprime, x must divide 3dy+1. So put 3dy+1=nx. Then 2dx+1=ny. Solving for x and y in terms of n and d we get x=(n+3d)/(n2−6d2),y=(n+2d)/(n2−6d2).
So we would certainly be home if we could show that there were infinitely many solutions to n2−6 d2=1. It is not hard to find the first few: 12−6.02=1,52−6⋅22=1,492−6⋅202=1. We notice that 492=2.52−1, so we wonder whether n=2.492−1 might be another solution and indeed we find it gives d=1960=2⋅49.20. This suggests we try (2n2−1)2−6(2nd)2=4n4− 4n2+1−24n2d2=4n2(n2−6d2−1)+1=1. So there are indeed infinitely many solutions to n2 −6 d2=1 and we are done.