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.

A200180 Number of -7..7 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 A200180 #7 Jun 02 2025 07:17:39
%S A200180 1,7,9,31,53,141,380,1010,2152,5014,14018,35542,78385,188789,503051,
%T A200180 1241939,2859687,6957672,17863397,43991846,103888178,253531752,
%U A200180 640390692,1575397895,3777406958,9259136398,23167497450,57008137128,138220165963
%N A200180 Number of -7..7 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 A200180 Column 7 of A200181
%H A200180 R. H. Hardin, <a href="/A200180/b200180.txt">Table of n, a(n) for n = 1..110</a>
%e A200180 Some solutions for n=6
%e A200180 ..3....6....7....2....3....4....1....2....6....2....5....2....6....4....5....2
%e A200180 .-1....5....2....3...-1....0....2....3....2....3...-1....0....0....2....6....0
%e A200180 ..0....6....3....4....0....1....3....4....3....4....0....1....1....3...-3....1
%e A200180 .-1...-6...-4...-3....1...-2....0...-4...-3...-2....1....2...-1...-2...-2....0
%e A200180 ..0...-5...-3...-2....2...-1....1...-3...-2...-1....2...-3....0...-1...-1....1
%e A200180 .-1...-6...-5...-4...-5...-2...-7...-2...-6...-6...-7...-2...-6...-6...-5...-4
%K A200180 nonn
%O A200180 1,2
%A A200180 _R. H. Hardin_ Nov 13 2011