|
Search: id:A143796
|
|
|
| A143796 |
|
Ackermann function, defined recursively by A(0,n) = n+1, A(m+1,0) = A(m,1), A(m+1,n+1) = A(m,A(m+1,n)) for any nonnegative integers n, m. Table read by antidiagonals, the second term being A(0,1). |
|
+0
2
|
|
| 1, 2, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 7, 13, 13, 6, 6, 9, 29, 65533, 65533, 7, 7, 11, 61
(list; table; graph; listen)
|
|
|
Search completed in 0.001 seconds
|
