%I #5 Dec 18 2015 18:18:22
%S 4,23,368,21512,3773045,2574187888
%N Number of n X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 n X n array
%C Diagonal of A219939
%e Some solutions for n=3
%e ..1..0..2....2..0..0....2..0..0....0..0..0....0..1..1....0..0..0....1..1..1
%e ..1..0..0....2..0..2....3..0..0....0..2..0....0..0..0....2..2..0....2..1..1
%e ..1..0..0....3..0..0....3..1..1....0..0..0....3..2..0....3..3..2....2..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Dec 01 2012