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 Nov 11 2014 12:33:31
%S 40054,159278,647122,2623376,10361063,38804209,134387611,508067629,
%T 1962422803,7613922448,29422302749,112682406459,425983285175,
%U 1629376150275,6294518310154,24375665892340,94351179211547
%N Number of length n+5 0..6 arrays with every six consecutive terms having the maximum of some two terms equal to the minimum of the remaining four terms
%C Column 6 of A250081
%H R. H. Hardin, <a href="/A250079/b250079.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..1....4....0....4....2....0....2....0....2....1....3....4....1....3....0....2
%e ..2....6....5....1....4....3....4....6....4....2....3....0....4....6....2....4
%e ..0....4....6....1....5....0....6....6....0....0....4....0....4....5....2....1
%e ..3....3....6....5....3....0....3....6....1....1....5....3....3....4....2....5
%e ..4....2....6....1....4....2....3....5....1....3....1....0....6....5....6....2
%e ..1....3....5....4....3....0....3....5....4....1....6....3....3....4....6....2
%e ..1....5....5....5....0....2....5....1....6....5....3....2....1....4....0....4
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 11 2014