The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #4 Jan 10 2014 11:02:20
%S 16,382,28962,7017768,5485253042,13868068262164,113555975474406500,
%T 3012872125570872924612
%N Number of (n+1)X(n+1) 0..1 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise
%C Diagonal of A235449
%e Some solutions for n=3
%e ..1..1..0..1....0..1..0..1....0..0..1..1....0..0..1..1....1..1..1..1
%e ..1..1..0..1....1..0..1..0....0..0..1..0....0..1..0..1....0..0..1..0
%e ..1..0..0..1....0..1..0..1....0..0..1..1....1..1..1..0....1..1..1..0
%e ..1..1..1..0....1..1..1..1....1..1..1..0....0..0..0..1....0..1..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 10 2014