cp's OEIS Frontend

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

%I A250165 #6 Jul 23 2025 12:14:37
%S A250165 7,67,639,5831,49037,380939,2810751,20169871,142786013,1004527983,
%T A250165 7047533399,49383700439,345855478109,2421574390899,16953120700735,
%U A250165 118679602696751,830786561364589,5815618832245175,40709771502502967
%N A250165 Number of length n+1 0..6 arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero.
%C A250165 Column 6 of A250167
%H A250165 R. H. Hardin, <a href="/A250165/b250165.txt">Table of n, a(n) for n = 1..29</a>
%e A250165 Some solutions for n=5
%e A250165 ..6....2....3....4....4....2....3....4....6....0....0....4....1....4....2....0
%e A250165 ..3....6....0....1....2....4....4....6....0....1....0....4....6....3....0....3
%e A250165 ..6....3....3....4....6....5....6....3....5....6....6....2....2....4....4....2
%e A250165 ..6....4....2....2....1....1....3....3....6....0....1....5....4....0....1....0
%e A250165 ..6....3....3....0....6....4....6....1....1....1....2....0....6....0....4....3
%e A250165 ..0....4....3....4....2....0....5....0....4....4....0....0....5....4....6....2
%K A250165 nonn
%O A250165 1,1
%A A250165 _R. H. Hardin_, Nov 13 2014