This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A250645 #5 Jul 23 2025 12:38:45 %S A250645 1,232,296,10766,56088,812004,6290716,61126790,491825108,4180573372, %T A250645 33502889991,273041099842,2183663605890,17568263304218, %U A250645 140464317638347,1125725667836824,9002272474197863,72061032003482452,576368920287459218 %N A250645 Number of length n+1 0..7 arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero. %C A250645 Column 7 of A250646 %e A250645 Some solutions for n=5 %e A250645 ..4....1....0....7....1....0....2....2....0....0....5....6....5....1....0....6 %e A250645 ..4....1....3....3....0....6....2....5....4....2....7....4....3....4....3....7 %e A250645 ..4....5....5....5....4....1....6....3....3....6....6....5....1....5....5....3 %e A250645 ..1....7....3....4....6....3....1....7....3....5....4....2....7....7....4....0 %e A250645 ..1....4....0....3....3....4....1....0....3....3....4....3....2....2....3....1 %e A250645 ..3....4....0....0....3....7....1....4....6....0....4....3....0....5....7....2 %K A250645 nonn %O A250645 1,2 %A A250645 _R. H. Hardin_, Nov 26 2014