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 09 2014 17:50:54
%S 28785,129095,585069,2662039,12123567,55191061,251002319,1147421312,
%T 5246484791,23984087410,109601404343,500636075284,2285872400437,
%U 10443922082696,47726833144173,218111897575829,996720875210647
%N Number of length n+5 0..5 arrays with no six consecutive terms having the maximum of any two terms equal to the minimum of the remaining four terms
%C Column 5 of A249960
%H R. H. Hardin, <a href="/A249957/b249957.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..2....3....1....2....0....0....0....1....2....4....3....4....1....0....0....4
%e ..0....3....5....1....0....5....4....5....3....0....3....1....5....5....1....1
%e ..3....2....0....3....5....3....1....0....3....3....1....4....2....5....2....5
%e ..5....5....2....2....4....5....4....0....3....5....0....2....5....5....0....2
%e ..5....0....5....1....2....5....5....2....0....4....3....5....1....4....2....5
%e ..0....0....4....4....5....4....3....2....1....4....4....4....3....5....4....5
%e ..4....1....1....5....1....2....2....4....3....5....5....1....5....1....3....3
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 09 2014