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 Feb 09 2014 05:59:14
%S 1888,25280,344128,4672896,63456608,862467040,11715351424,
%T 159023453952,2159737999232,29352841877120,398714501823488,
%U 5412158969910144,73503840800214272,998985586501116032,13569728204514266112
%N Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
%C Column 2 of A237544
%H R. H. Hardin, <a href="/A237540/b237540.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 33284*a(n-4) +25223312*a(n-8) +9872851088*a(n-12) +1714176739904*a(n-16) +117040615631104*a(n-20) -15333075217254400*a(n-24) +298524650406981632*a(n-28) -1514873805416611840*a(n-32) -6055029689993396224*a(n-36) +62325077822438113280*a(n-40) -94646495250940428288*a(n-44) +39539525251177119744*a(n-48) for n>50
%e Some solutions for n=2
%e ..1..3..1....3..2..3....1..0..2....1..1..1....2..2..1....2..0..2....2..3..0
%e ..3..0..0....2..1..3....1..1..3....2..3..1....3..3..3....2..3..3....3..3..2
%e ..1..2..3....0..0..0....3..3..2....2..3..2....1..0..2....0..3..2....0..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 09 2014