Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Dec 18 2015 18:18:53
%S 1,5,44,711,17962,578342,21312696,857248091,36723156004,1650365159314,
%T 77015673357558,3704833216794534,182732875391479366,
%U 9203662331845611018,471886132793225715184,24568007717042452684419,1296265434331412271116602
%N Number of n X n nonnegative integer arrays with upper left 0 and every value within 3 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down
%C Diagonal of A252938
%H R. H. Hardin, <a href="/A252931/b252931.txt">Table of n, a(n) for n = 1..24</a>
%e Some solutions for n=4
%e ..0..0..1..1....0..0..1..1....0..0..1..1....0..0..1..1....0..0..1..1
%e ..1..1..1..1....0..1..1..2....0..0..1..2....1..1..1..2....1..1..1..2
%e ..1..1..1..1....0..1..2..2....0..1..1..2....2..2..2..2....2..2..2..2
%e ..2..2..2..2....1..1..2..3....0..1..2..2....2..2..2..2....2..2..2..3
%K nonn
%O 1,2
%A _R. H. Hardin_, Dec 24 2014