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 A252175 #5 Jul 23 2025 13:37:18 %S A252175 7,917,2729,39109,277101,2485637,18231947,135424961,963247737, %T A252175 6838373877,48103629141,337900112109,2368821073603,16597473994629, %U A252175 116236940081089 %N A252175 Number of length n+2 0..6 arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero. %C A252175 Column 6 of A252177 %e A252175 Some solutions for n=4 %e A252175 ..3....6....3....4....6....2....6....0....4....0....5....6....5....0....0....0 %e A252175 ..2....1....6....4....3....1....0....2....0....6....6....4....6....0....1....4 %e A252175 ..4....2....6....5....5....4....2....2....5....0....3....4....1....5....3....5 %e A252175 ..5....1....1....5....3....2....6....0....0....0....6....6....5....1....5....0 %e A252175 ..5....4....3....2....1....3....5....4....5....5....1....5....0....2....2....6 %e A252175 ..3....1....0....5....0....1....2....1....3....5....4....4....3....5....6....1 %K A252175 nonn %O A252175 1,1 %A A252175 _R. H. Hardin_, Dec 15 2014