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 A200175 #7 Jun 02 2025 07:17:06 %S A200175 1,2,3,6,12,15,29,72,133,214,394,853,1782,3087,5597,11777,24069,45200, %T A200175 83805,167284,342971,664695,1257505,2476990,4999659,9864713,19023479, %U A200175 37228518,74480796,147868410,288747975,565957525,1124938149,2237002991 %N A200175 Number of -2..2 arrays x(0..n-1) of n elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern). %C A200175 Column 2 of A200181 %H A200175 R. H. Hardin, <a href="/A200175/b200175.txt">Table of n, a(n) for n = 1..200</a> %e A200175 All solutions for n=6 %e A200175 ..1....2....1...-1....2....1...-2....0...-1....2....0....0....0....2....0 %e A200175 ..0...-2...-1....0....1...-1...-1...-1....0....0....1....1...-2....0....1 %e A200175 ..1...-1....0....1....2....0....0....0....1....1....2...-1...-1....1....2 %e A200175 .-1....0....1...-1...-2...-1....1....1....0...-2...-2....0....0...-1...-1 %e A200175 ..0....1...-1....0...-1....0....2....2....1...-1...-1....1....1....0....0 %e A200175 .-1....0....0....1...-2....1....0...-2...-1....0....0...-1....2...-2...-2 %K A200175 nonn %O A200175 1,2 %A A200175 _R. H. Hardin_ Nov 13 2011