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 A250416 #6 Jul 23 2025 12:23:03 %S A250416 11,106,370,3154,16790,119364,713260,4620694,28033122,174036890, %T A250416 1052524169,6409923762,38618278972,233193985046,1401840843777, %U A250416 8433815453844,50645668891739,304220519953548,1825994803261130 %N A250416 Number of length n+1 0..5 arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero. %C A250416 Column 5 of A250419 %H A250416 R. H. Hardin, <a href="/A250416/b250416.txt">Table of n, a(n) for n = 1..47</a> %e A250416 Some solutions for n=6 %e A250416 ..3....5....3....1....5....4....5....2....2....3....1....2....5....2....4....5 %e A250416 ..0....1....0....5....1....1....2....1....4....0....3....3....3....2....0....2 %e A250416 ..5....3....4....1....0....2....3....4....1....1....3....3....2....4....4....3 %e A250416 ..3....1....5....4....4....0....3....1....5....0....0....5....3....2....0....5 %e A250416 ..5....3....4....3....5....5....3....1....1....2....2....2....4....3....3....0 %e A250416 ..0....5....3....5....3....2....3....0....4....0....1....0....2....3....3....3 %e A250416 ..0....1....3....3....2....2....4....0....5....4....1....3....3....1....4....1 %K A250416 nonn %O A250416 1,1 %A A250416 _R. H. Hardin_, Nov 22 2014