login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A250418 Number of length n+1 0..7 arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero 1

%I #4 Nov 22 2014 19:29:46

%S 15,232,927,11906,84094,845358,6847916,60473968,493271080,4110606460,

%T 33227112639,270174922792,2170847791630,17476736034672,

%U 140045328565480,1123079823815258,8990031255733660,71987420633900826,576024775450468215

%N Number of length n+1 0..7 arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero

%C Column 7 of A250419

%H R. H. Hardin, <a href="/A250418/b250418.txt">Table of n, a(n) for n = 1..23</a>

%e Some solutions for n=5

%e ..0....2....7....2....7....2....7....7....2....3....0....2....2....6....0....2

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 22 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 17 08:52 EDT 2024. Contains 375987 sequences. (Running on oeis4.)