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 #5 Jan 13 2014 07:46:54
%S 3038,105752,3377510,97225212,2654051460,69130583300,1747603214578,
%T 43136654198960,1047132137240314,25095456411611898,595867012132487010,
%U 14049371809599315902,329547900284607478246,7700165644063519174328
%N Number of (n+1)X(2+1) 0..3 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise
%C Column 2 of A235665
%H R. H. Hardin, <a href="/A235662/b235662.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..1..2..2....2..3..1....2..2..2....3..0..1....0..0..0....0..1..2....3..0..2
%e ..0..0..3....0..0..3....1..0..2....2..1..3....0..2..0....0..1..3....3..1..3
%e ..2..0..3....0..0..1....1..0..2....2..0..2....1..2..2....0..1..2....3..3..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 13 2014