cp's OEIS Frontend

A250166 Number of length n+1 0..7 arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero.

%I A250166 #6 Jul 23 2025 12:14:42
%S A250166 8,88,976,10460,103556,938128,7989940,65768448,532548628,4281269376,
%T A250166 34316191340,274736779444,2198552029712,17590557578440,
%U A250166 140731669092632,1125878500233800,9007118671839640,72057285402401144,576459555378977560
%N A250166 Number of length n+1 0..7 arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero.
%C A250166 Column 7 of A250167
%H A250166 R. H. Hardin, <a href="/A250166/b250166.txt">Table of n, a(n) for n = 1..22</a>
%e A250166 Some solutions for n=5
%e A250166 ..2....5....5....4....1....1....1....2....0....4....3....5....1....6....4....4
%e A250166 ..1....5....0....6....3....6....7....7....5....2....2....7....4....4....3....6
%e A250166 ..5....7....3....3....1....5....3....3....3....2....1....2....6....5....5....7
%e A250166 ..6....6....6....5....1....2....4....4....5....0....5....6....2....4....6....2
%e A250166 ..5....7....7....3....2....3....6....5....4....0....7....7....3....4....5....1
%e A250166 ..2....7....7....2....1....1....5....4....0....0....7....5....5....2....6....0
%K A250166 nonn
%O A250166 1,1
%A A250166 _R. H. Hardin_, Nov 13 2014