(6, 3), (9, 3), (9, 5) and (54, 5).
Note that when n is fixed, this is a quadratic equation in m; the condition for m to have an integer solution is that the discriminant is a perfect square. Solving the quadratic equations for n=0,1,2,3,4,5 shows that for n≤5 there are exactly the four solutions described above. Below we prove that there are no solutions for n≥6.
Suppose (m,n) satisfies the equation of this problem and n≥6, then m∣2⋅3n=m(2n+1−m−1),
so m can be written as m=3p or m=2⋅3q.
In the first case, let q=n−p, we have
2n+1−1=m+m2⋅3n=3p+2⋅3q.
In the second case, let p=n−q, we have
2n+1−1=m+m2⋅3n=2⋅3q+3p.
Thus in either case we have 2n+1−1=3p+2⋅3q, with 0≤p,q≤n,p+q=n.
Now we estimate the range of p,q, consider
3p<2n+1=83n+1<93n+1=332(n+1)
Similarly we have 2⋅3q<332(n+1), so p,q<32(n+1). From p+q=n we also obtain p,q>3n−2.
Let h=min(p,q), we have 3h∣3p+2⋅3q=2n+1−1. Then since h>3n−2>1,
2n+1−1 is a multiple of 9. It is easy to deduce that in this case 6∣n+1.
Therefore we may write n+1=6r. Then we have
2n+1−1=43r−1=(42r+4r+1)(2r+1)(2r−1).
Note that 42r+4r+1=(4r−1)2+3⋅4r is certainly a multiple of 3 but certainly not a multiple of 9. Also 2r+1 and 2r−1 differ by 2, so only one of them can be a multiple of 3. Whichever one it is, it must be divisible by 3h−1. In either case, we have
3h−1≤2r+1≤3r
hence h−1≤r. But earlier we had h>3n−2, and r=6n+1, from which it clearly follows that n<11. This contradicts 6∣n+1 and n≥6, so there are no solutions for n≥6.