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 04 2014 05:39:08
%S 912848,367558796,122764464080,46125739204336,17061532793217332,
%T 6399495495536326520,2398218580217967150868,900276780894997367776564,
%U 337969231782493957282033632,126904133080043026712912666124
%N Number of (n+1)X(5+1) 0..3 arrays with the maximum plus the minimum of every 2X2 subblock equal
%C Column 5 of A237158
%H R. H. Hardin, <a href="/A237155/b237155.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=1
%e ..0..2..1..3..3..3....0..0..3..0..0..2....0..2..0..3..3..3....0..0..3..1..0..3
%e ..1..3..0..2..0..2....0..3..3..3..3..3....3..1..3..1..0..1....1..3..3..0..3..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 04 2014