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 Jun 26 2022 03:09:19
%S 2936,76340,1971348,51179036,1330663048,34586439766,898451728732,
%T 23340692708758,606449327351216,15757063282924732,409388961057055582,
%U 10636475509484365260,276353315572536082076,7180115918481602175568
%N Number of (n+1) X (2+1) 0..3 arrays colored with the upper median plus the lower median minus the minimum of every 2 X 2 subblock.
%C Column 2 of A236198.
%H R. H. Hardin, <a href="/A236196/b236196.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..1..3..1....1..1..0....1..3..2....1..1..1....2..1..0....2..1..2....3..2..2
%e ..3..0..0....3..0..0....2..3..2....0..1..3....3..0..0....0..0..3....1..3..3
%e ..0..3..2....2..2..3....2..1..1....0..0..1....0..2..1....2..0..1....3..3..2
%Y Cf. A236198.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 20 2014