cp's OEIS Frontend

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.

%I A365469 #20 Sep 05 2023 16:56:15
%S A365469 0,0,0,0,0,1,923,414638,141905658,44926520946,14490345222595,
%T A365469 4982468227997168,1856518533812384105,750167381136816327009,
%U A365469 326628155352701098746754,151933161224857150407326456,74864085012461648054019799968,38785037369022058785365519932029
%N 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.
%H A365469 Robert Dougherty-Bliss and Manuel Kauers, <a href="https://arxiv.org/abs/2309.00487">Hardinian Arrays</a>, arXiv:2309.00487 [math.CO], 2023.
%F A365469 Conjecture: a(n) ~ (2^4 / (3^23 * Pi^2)) * 1024^n / n^10.
%e A365469 Example for n = 8:
%e A365469   00011112
%e A365469   11111122
%e A365469   22222222
%e A365469   22222222
%e A365469   22222222
%e A365469   22222222
%e A365469   22222222
%e A365469   22222222
%Y A365469 Cf. A253026, A253217, A252998.
%K A365469 nonn
%O A365469 1,7
%A A365469 _Robert Dougherty-Bliss_, Sep 04 2023