cp's OEIS Frontend

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

%I A250644 #6 Jun 19 2025 22:47:11
%S A250644 1,161,219,5901,28379,332827,2225195,18399217,129137886,953809557,
%T A250644 6704767056,47777146765,335147823244,2360792885729,16540740396740,
%U A250644 116054610957529,812699929957712,5694036707961181,39865043590813086
%N A250644 Number of length n+1 0..6 arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.
%C A250644 Column 6 of A250646.
%H A250644 R. H. Hardin, <a href="/A250644/b250644.txt">Table of n, a(n) for n = 1..25</a>
%e A250644 Some solutions for n=5
%e A250644 ..6....4....1....2....3....4....4....2....3....0....4....3....6....4....6....3
%e A250644 ..4....1....0....0....1....6....0....1....6....2....5....1....0....3....4....1
%e A250644 ..4....1....3....0....4....1....1....5....2....0....3....1....3....0....2....0
%e A250644 ..0....0....4....5....3....5....3....0....0....0....6....3....5....3....0....0
%e A250644 ..4....2....6....2....2....2....5....4....0....2....0....2....3....0....6....0
%e A250644 ..6....6....1....1....1....2....5....0....2....1....2....2....1....5....5....4
%Y A250644 Cf. A250646.
%K A250644 nonn
%O A250644 1,2
%A A250644 _R. H. Hardin_, Nov 26 2014