Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Jan 18 2014 13:05:12
%S 508,4568,41608,389520,3726296,36383144,361779592,3655701448,
%T 37454598528,388247972432,4063669727288,42871361603912,
%U 455195773077752,4858023680834872,52059161943692016,559682634231909344
%N Number of (n+1)X(2+1) 0..3 arrays with the minimum plus the maximum equal to the lower median plus the upper median in every 2X2 subblock
%C Column 2 of A236009
%H R. H. Hardin, <a href="/A236004/b236004.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 43*a(n-1) -763*a(n-2) +7147*a(n-3) -36573*a(n-4) +84065*a(n-5) +69894*a(n-6) -844584*a(n-7) +1395964*a(n-8) +1156720*a(n-9) -4996336*a(n-10) +928096*a(n-11) +6404480*a(n-12) -1078656*a(n-13) -4024832*a(n-14) -1081344*a(n-15) +79872*a(n-16) +32768*a(n-17)
%e Some solutions for n=3
%e ..3..1..2....0..1..0....2..1..2....2..1..3....2..2..0....2..1..1....3..0..3
%e ..0..2..1....1..2..1....0..1..2....3..0..2....1..1..1....1..0..2....2..1..2
%e ..2..0..1....1..2..3....2..1..2....2..1..3....2..2..2....2..3..1....2..1..0
%e ..1..1..0....2..3..2....1..0..1....1..0..2....3..1..3....3..2..0....0..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 18 2014