A365468 Number of n X n nonnegative integer arrays with upper left entry 0, lower right entry n - 5, every value within 4 of its king-move distance from the upper left, and every value increasing by 0 or 1 with every step right, diagonally southeast, or down.
0, 0, 0, 0, 1, 251, 35176, 4105312, 466029138, 54944041476, 6886218018445, 920364154307990, 130498580283240363, 19482086451147555715, 3039784702880850466554, 492560752706827973431360, 82451674043232981553367317, 14196926753609833253834234271
Offset: 1
Keywords
Examples
Example for n = 7: 0011112 0111222 0111222 0112222 0112222 1111222 2222222
Links
- Robert Dougherty-Bliss and Manuel Kauers, Hardinian Arrays, arXiv 2309.00487 [math.CO], 2023.
Formula
Conjecture: a(n) ~ (2^2 / (3^16 * Pi^2)) * 256^n / n^6.