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 #4 Jan 12 2014 08:46:59
%S 2896,100653,3187679,88558785,2266703217,53743314489,1204872525582,
%T 25761758641087,530640585223234,10596542672869573,206322100962240719,
%U 3933589245572314823,73696129029630789335,1360660167404660439759
%N Number of (n+1)X(2+1) 0..3 arrays with the difference of the upper median and minimum value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise
%C Column 2 of A235582
%H R. H. Hardin, <a href="/A235580/b235580.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..0..1..3....3..2..3....1..1..0....2..1..3....1..2..0....3..2..3....1..0..1
%e ..1..3..0....2..2..0....3..1..2....0..0..2....1..3..1....1..2..3....0..2..2
%e ..0..2..3....3..3..1....3..2..1....2..3..3....3..3..0....2..3..1....2..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 12 2014