Skip to main content
MathOverflow

Return to Answer

OEIS link updated.
Source Link
edit approved Oct 29, 2013 at 11:48
Abhimanyu Pallavi Sudhir
edit approved Oct 29, 2013 at 11:48
Abhimanyu Pallavi Sudhir
  • 347
  • 5
  • 17

For the case when $m = n$, these appear to have been computed as this sequence in Sloanethis 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.

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.

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.

Source Link
Michael Lugo
Michael Lugo
  • 14k
  • 7
  • 58
  • 80

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.