The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A250080 Number of length n+5 0..7 arrays with every six consecutive terms having the maximum of some two terms equal to the minimum of the remaining four terms 1

%I

%S 80284,352192,1572320,6978064,30011560,121263104,446774000,1834111512,

%T 7701187928,32463331040,136011056960,563229803248,2292798259376,

%U 9485676333072,39709503113592,166580802178112,697854772322004

%N Number of length n+5 0..7 arrays with every six consecutive terms having the maximum of some two terms equal to the minimum of the remaining four terms

%C Column 7 of A250081

%H R. H. Hardin, <a href="/A250080/b250080.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=1

%e ..3....4....3....2....0....5....6....0....0....7....2....1....0....5....0....0

%e ..1....7....4....4....5....7....4....0....4....1....0....0....6....3....3....4

%e ..4....4....7....0....2....4....2....0....6....1....2....6....4....1....6....6

%e ..6....4....4....2....5....4....5....0....1....0....1....5....2....3....3....4

%e ..3....4....3....5....7....6....4....5....1....5....1....1....3....1....4....6

%e ..7....6....2....2....2....3....5....7....7....5....7....4....2....1....4....5

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 11 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 20 07:54 EST 2020. Contains 332069 sequences. (Running on oeis4.)