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 07 2014 21:16:34
%S 35,4019,118638,1599494,12991337,74439217,331379292,1219778604,
%T 3872511183,10923962159,27981170954,66148387890,146141454485,
%U 304712555117,604328255416,1147307969496,2095939712763,3700448828331
%N Number of length 4+6 0..n arrays with no seven consecutive terms having the maximum of any three terms equal to the minimum of the remaining four terms
%C Row 4 of A249883
%H R. H. Hardin, <a href="/A249887/b249887.txt">Table of n, a(n) for n = 1..52</a>
%F Empirical: a(n) = n^10 + (37/105)*n^9 + (363/70)*n^8 + (442/105)*n^7 + (917/90)*n^6 + (211/30)*n^5 + (149/90)*n^4 + (407/70)*n^3 - (167/315)*n^2 + (19/210)*n
%e Some solutions for n=3
%e ..0....0....3....1....0....1....0....2....2....1....2....1....3....1....1....1
%e ..1....2....1....0....1....0....0....2....1....1....1....0....0....3....0....2
%e ..2....3....1....3....2....2....3....0....0....3....2....3....2....0....1....2
%e ..3....1....3....0....0....3....1....2....0....0....0....2....0....3....3....1
%e ..3....3....1....2....1....1....3....1....0....0....1....2....3....3....0....3
%e ..1....0....2....0....3....3....2....0....2....0....3....3....2....3....3....2
%e ..3....0....2....1....0....3....0....3....1....1....3....0....1....1....0....0
%e ..3....2....2....2....0....0....0....0....2....1....3....0....0....0....1....1
%e ..0....2....1....3....1....3....2....2....2....2....0....1....3....3....0....2
%e ..1....2....1....3....1....1....0....2....0....2....3....2....0....1....3....2
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 07 2014