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.

A287968 Number of Dyck paths of semilength n such that no level has more than four peaks.

This page as a plain text file.
%I A287968 #6 Jun 03 2017 19:12:36
%S A287968 1,1,2,5,14,41,130,414,1365,4564,15491,53147,184014,641710,2251113,
%T A287968 7937416,28108741,99903584,356181450,1273253851,4561936460,
%U A287968 16377201916,58894487282,212108951615,764910126587,2761577715513,9980164366260,36099265669505,130675238973018
%N A287968 Number of Dyck paths of semilength n such that no level has more than four peaks.
%H A287968 Alois P. Heinz, <a href="/A287968/b287968.txt">Table of n, a(n) for n = 0..1000</a>
%H A287968 Wikipedia, <a href="https://en.wikipedia.org/wiki/Lattice_path#Counting_lattice_paths">Counting lattice paths</a>
%F A287968 a(n) = A287847(n,4).
%F A287968 a(n) = A000108(n) for n <= 4.
%Y A287968 Column k=4 of A287847.
%Y A287968 Cf. A000108.
%K A287968 nonn
%O A287968 0,3
%A A287968 _Alois P. Heinz_, Jun 03 2017