|
|
A365469
|
|
Number of n X n nonnegative integer arrays with upper left entry 0, lower right entry n - 6, every value within 5 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, 0, 0, 1, 923, 414638, 141905658, 44926520946, 14490345222595, 4982468227997168, 1856518533812384105, 750167381136816327009, 326628155352701098746754, 151933161224857150407326456, 74864085012461648054019799968, 38785037369022058785365519932029
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,7
|
|
LINKS
|
Robert Dougherty-Bliss and Manuel Kauers, Hardinian Arrays, arXiv:2309.00487 [math.CO], 2023.
|
|
FORMULA
|
Conjecture: a(n) ~ (2^4 / (3^23 * Pi^2)) * 1024^n / n^10.
|
|
EXAMPLE
|
Example for n = 8:
00011112
11111122
22222222
22222222
22222222
22222222
22222222
22222222
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|