cp's OEIS Frontend

A250643 Number of length n+1 0..5 arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.

%I A250643 #6 Jul 23 2025 12:38:38
%S A250643 1,106,134,2954,12473,120114,677505,4749950,28200435,177863786,
%T A250643 1063874048,6491819162,38892883673,234724691398,1407192408230,
%U A250643 8460554956974,50741165814612,304671802762820,1827631230875303
%N A250643 Number of length n+1 0..5 arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.
%C A250643 Column 5 of A250646
%H A250643 R. H. Hardin, <a href="/A250643/b250643.txt">Table of n, a(n) for n = 1..40</a>
%e A250643 Some solutions for n=6
%e A250643 ..2....1....1....2....4....3....3....4....2....5....0....1....0....1....2....3
%e A250643 ..3....2....3....4....4....3....1....2....3....3....4....0....1....4....1....0
%e A250643 ..5....5....3....2....0....2....1....5....5....1....3....4....3....4....2....1
%e A250643 ..4....2....5....5....5....2....2....0....5....4....4....0....3....3....2....2
%e A250643 ..4....4....5....0....2....3....5....2....0....1....4....0....0....5....1....4
%e A250643 ..0....4....1....2....2....0....4....4....4....3....4....4....1....4....5....2
%e A250643 ..5....4....5....2....2....4....2....1....2....0....1....5....1....4....0....2
%K A250643 nonn
%O A250643 1,2
%A A250643 _R. H. Hardin_, Nov 26 2014