|
%I #4 Nov 22 2014 19:28:29
%S 11,106,370,3154,16790,119364,713260,4620694,28033122,174036890,
%T 1052524169,6409923762,38618278972,233193985046,1401840843777,
%U 8433815453844,50645668891739,304220519953548,1825994803261130
%N Number of length n+1 0..5 arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero
%C Column 5 of A250419
%H R. H. Hardin, <a href="/A250416/b250416.txt">Table of n, a(n) for n = 1..47</a>
%e Some solutions for n=6
%e ..3....5....3....1....5....4....5....2....2....3....1....2....5....2....4....5
%e ..0....1....0....5....1....1....2....1....4....0....3....3....3....2....0....2
%e ..5....3....4....1....0....2....3....4....1....1....3....3....2....4....4....3
%e ..3....1....5....4....4....0....3....1....5....0....0....5....3....2....0....5
%e ..5....3....4....3....5....5....3....1....1....2....2....2....4....3....3....0
%e ..0....5....3....5....3....2....3....0....4....0....1....0....2....3....3....3
%e ..0....1....3....3....2....2....4....0....5....4....1....3....3....1....4....1
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 22 2014
| 