A329118 Array read by antidiagonals: T(m, n) is the number of simple paths from corner to diagonally opposite corner on an m X n grid with king moves allowed.
1, 1, 1, 1, 5, 1, 1, 24, 24, 1, 1, 116, 235, 116, 1, 1, 560, 2922, 2922, 560, 1, 1, 2704, 38169, 96371, 38169, 2704, 1, 1, 13056, 494596, 3764367, 3764367, 494596, 13056, 1, 1, 63040, 6375379, 150610151, 447544629, 150610151, 6375379, 63040, 1, 1, 304384, 82191766, 5898799685, 56182569218, 56182569218, 5898799685, 82191766, 304384, 1
Offset: 1
Examples
Array begins: =================================================================== m\n | 1 2 3 4 5 6 ----+-------------------------------------------------------------- 1 | 1 1 1 1 1 1 ... 2 | 1 5 24 116 560 2704 ... 3 | 1 24 235 2922 38169 494596 ... 4 | 1 116 2922 96371 3764367 150610151 ... 5 | 1 560 38169 3764367 447544629 56182569218 ... 6 | 1 2704 494596 150610151 56182569218 22132498074021 ... 7 | 1 13056 6375379 5898799685 6972159602221 8656506756327178 ... ...
Links
- Andrew Howroyd, Table of n, a(n) for n = 1..231