My first thought would be to do it in bc,

define ack(m, n) {
  if (m == 0) {
    return (n + 1)
  }
  if (n == 0) {
    return (ack (m - 1, 1)) 
  }
  return (ack (m - 1, ack (m, n - 1)))
}

Yup, that’s what it seems like. Thanks.

if you try to work the function out on paper the value “m” variable is so much more important than the value of “n” variable that A(4,1) is not that different from A(4,2) at all! a huge number of “n”‘s must be needed to equal just one “m”