%I #5 Dec 18 2015 18:18:22
%S 3,6,62,648,11395,510090,59065976
%N Number of n X n arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X n array
%C Diagonal of A219816
%e Some solutions for n=3
%e ..1..0..0....1..0..0....0..0..0....0..0..0....1..0..0....2..1..1....0..0..0
%e ..1..0..0....1..0..0....2..0..0....1..0..0....2..1..0....2..1..1....0..0..0
%e ..2..1..0....2..2..0....2..2..1....2..2..0....2..1..1....2..1..1....0..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Nov 28 2012