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 10 2014 15:43:10
%S 8840,30360,106352,375756,1332504,4732480,16813550,59817840,212915478,
%T 758003332,2698865532,9609878582,34219609768,121858453182,
%U 433960960558,1545451040312,5503832271270,19601024153832,69806391180594
%N Number of length n+5 0..4 arrays with no six consecutive terms having the maximum of any three terms equal to the minimum of the remaining three terms
%C Column 4 of A250014
%H R. H. Hardin, <a href="/A250010/b250010.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..2....2....2....4....3....0....3....4....1....2....0....4....2....3....3....1
%e ..4....4....4....0....4....2....0....1....4....0....4....1....2....0....0....4
%e ..2....1....0....1....1....3....2....0....1....4....4....3....2....0....0....0
%e ..4....3....4....4....0....4....1....3....4....3....3....2....4....3....0....0
%e ..2....0....0....1....1....4....0....1....0....0....4....4....3....0....1....4
%e ..3....0....0....2....4....2....3....4....2....1....3....4....3....2....2....0
%e ..4....0....1....4....4....4....0....2....3....4....3....4....0....3....3....1
%e ..0....1....3....4....3....0....0....4....1....2....4....1....1....0....4....3
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 10 2014