For the case when $m = n$, these appear to have been computed as this sequence in Sloane. I don't know how they were computed, though; I found the sequence by solving the cases $m = n = 1$, $m = n = 2$, $m = n = 3$ by hand and searching.
2 of 2
OEIS link updated.
Michael Lugo
- 14k
- 7
- 58
- 80