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 Dec 15 2023 20:21:58
%S 5038,44648,408824,4021892,40288632,418287818,4418514021,47970957966,
%T 529234228994,5972920589738,68350297258483,796609824373786,
%U 9387787977650655,112196010761065635,1352091822449547149
%N Number of (n+1) X (3+1) 0..3 arrays with the maximum plus the upper median plus the minimum minus the lower median of every 2 X 2 subblock equal.
%C Column 3 of A237694.
%H R. H. Hardin, <a href="/A237690/b237690.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..3..1..2..1....0..2..1..3....1..1..0..1....2..2..1..0....1..0..2..0
%e ..0..2..1..2....0..3..3..2....1..3..0..3....2..3..3..3....2..2..1..0
%e ..0..2..3..0....1..3..2..2....2..2..1..2....0..0..1..2....2..1..1..3
%Y Cf. A237694.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 11 2014