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 #7 Nov 22 2023 21:05:02
%S 3,7,84,2275,143187,23986853,10160088596
%N Number of n X n arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 n X n array.
%C Diagonal of A219381.
%e Some solutions for n=3
%e ..1..1..2....0..0..1....0..0..1....1..1..2....0..0..2....0..0..1....0..0..1
%e ..1..1..2....1..0..1....1..0..0....1..1..2....1..0..2....0..0..0....0..0..1
%e ..1..1..2....1..2..1....2..0..0....2..1..2....1..1..2....1..0..0....2..0..2
%Y Cf. A219381.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 19 2012