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 30 2014 06:50:42
%S 4227,21829,105206,607539,3413516,21593010,134575906,924460811,
%T 6207464355,45401368428,320074824585,2438445808960,17698173021054,
%U 138099810742762,1019098153303299,8058980038095509,60035917549887504
%N Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock equal
%C Column 5 of A236728
%H R. H. Hardin, <a href="/A236725/b236725.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..2..0..2..0..2..2....1..0..1..0..1..2....0..2..1..0..1..2....2..1..2..1..2..1
%e ..1..1..1..1..1..1....2..1..2..1..2..1....0..2..1..2..1..0....1..2..1..0..1..2
%e ..2..2..0..2..2..0....1..2..1..2..1..2....0..2..1..0..1..2....1..2..1..2..1..2
%e ..1..1..1..1..1..1....1..0..1..2..1..0....2..0..1..2..1..2....1..2..1..0..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 30 2014