cp's OEIS Frontend

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

%I A250650 #6 Jul 23 2025 12:39:07
%S A250650 72,1061,7696,34441,120114,332827,812004,1749359,3497934,6469165,
%T A250650 11395070,19047473,30746306,47793245,72401338,106583429,153809996,
%U A250650 217072541,301491734,411350415,553983224,735181841,965180792,1251735269
%N A250650 Number of length 6+1 0..n arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.
%C A250650 Row 6 of A250646
%H A250650 R. H. Hardin, <a href="/A250650/b250650.txt">Table of n, a(n) for n = 1..55</a>
%e A250650 Some solutions for n=5
%e A250650 ..2....1....2....5....5....2....1....0....5....5....1....2....3....4....5....1
%e A250650 ..3....0....2....3....0....0....0....2....2....4....0....3....3....3....3....2
%e A250650 ..4....3....0....1....4....2....3....5....5....3....2....5....1....1....3....5
%e A250650 ..3....3....5....0....1....2....0....2....5....3....4....5....1....0....3....4
%e A250650 ..4....2....0....3....0....4....1....3....5....4....5....2....0....5....2....0
%e A250650 ..3....0....1....3....3....5....3....2....5....4....2....4....3....4....0....4
%e A250650 ..1....2....1....0....1....5....1....0....3....3....5....4....0....3....4....1
%K A250650 nonn
%O A250650 1,1
%A A250650 _R. H. Hardin_, Nov 26 2014