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.

A200174 Number of -1..1 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 A200174 #8 Jun 02 2025 07:16:59
%S A200174 1,1,3,3,2,6,10,7,12,28,29,29,70,105,96,169,327,363,449,914,1302,1426,
%T A200174 2455,4220,5030,6925,12579,17582,21687,36154,57823,73301,106333,
%U A200174 179101,250064,332708,538040,825039,1097810,1630708,2613839,3676575,5125886
%N A200174 Number of -1..1 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 A200174 Column 1 of A200181
%H A200174 R. H. Hardin, <a href="/A200174/b200174.txt">Table of n, a(n) for n = 1..200</a>
%e A200174 All solutions for n=6
%e A200174 .-1...-1....1....0....1....1
%e A200174 ..0....0...-1....1....0...-1
%e A200174 ..1....1....0...-1....1....0
%e A200174 .-1....0...-1....0...-1....1
%e A200174 ..0....1....0....1....0...-1
%e A200174 ..1...-1....1...-1...-1....0
%K A200174 nonn
%O A200174 1,3
%A A200174 _R. H. Hardin_ Nov 13 2011