cp's OEIS Frontend

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.

A200179 Number of -6..6 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).

This page as a plain text file.
%I A200179 #9 Sep 05 2025 14:58:49
%S A200179 1,6,7,26,48,103,246,700,1573,3247,8034,21608,50100,109071,268358,
%T A200179 690150,1629202,3709231,9026969,22707455,54349757,126747830,308139152,
%U A200179 765740522,1845805544,4379391584,10654557350,26290537792,63724232354,152906665554
%N A200179 Number of -6..6 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 A200179 Column 6 of A200181.
%H A200179 R. H. Hardin, <a href="/A200179/b200179.txt">Table of n, a(n) for n = 1..200</a>
%e A200179 Some solutions for n=6
%e A200179 ..5....0....4....3....3....6....2....3....2....1....4....4....3....2....0....4
%e A200179 ..1....1....5....2....1...-2....0...-1....3....2....2....1....1....0....1...-1
%e A200179 ..2....2....6....3....2...-1....1....0....4....3....3....2....2....1....2....0
%e A200179 .-2...-1...-6...-2...-3....0....0....1...-2...-2...-4...-1...-2....2....1....1
%e A200179 .-1....0...-5...-1...-2...-2....1....2...-1...-1...-3....0...-1...-3....2....2
%e A200179 .-5...-2...-4...-5...-1...-1...-4...-5...-6...-3...-2...-6...-3...-2...-6...-6
%Y A200179 Cf. A200181.
%K A200179 nonn,changed
%O A200179 1,2
%A A200179 _R. H. Hardin_, Nov 13 2011