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 #6 Mar 15 2023 11:23:36
%S 121590,5747502,269108894,13643698414,692297987804,36178398554012,
%T 1890491225892878,100148557160615280,5305466920253259264,
%U 283011393021083999606,15099947793285680101269,808583766977800373774476
%N Number of (n+1) X (6+1) 0..2 arrays with the maximum plus the minimum minus the lower median of every 2 X 2 subblock equal.
%C Column 6 of A236828.
%H R. H. Hardin, <a href="/A236826/b236826.txt">Table of n, a(n) for n = 1..123</a>
%e Some solutions for n=1
%e ..0..0..2..2..2..0..1....1..0..1..0..1..1..0....0..2..0..2..2..0..2
%e ..0..1..1..0..1..1..0....0..1..0..1..0..2..1....1..0..0..1..1..0..2
%Y Cf. A236828.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 31 2014