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.

A288549 Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals ten.

This page as a plain text file.
%I A288549 #5 Jun 13 2017 14:40:33
%S A288549 1,0,0,0,0,0,0,0,0,0,0,11,617,11682,111628,647031,2549052,7450806,
%T A288549 17538521,36151610,70400319,135895815,264323951,518450934,1023822867,
%U A288549 2049148367,4479979364,14822867382,94735430157,762796968038,5681481177599,36810532399638
%N A288549 Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals ten.
%H A288549 Alois P. Heinz, <a href="/A288549/b288549.txt">Table of n, a(n) for n = 10..300</a>
%H A288549 Wikipedia, <a href="https://en.wikipedia.org/wiki/Lattice_path#Counting_lattice_paths">Counting lattice paths</a>
%Y A288549 Column k=10 of A288387.
%Y A288549 Cf. A000108.
%K A288549 nonn
%O A288549 10,12
%A A288549 _Alois P. Heinz_, Jun 11 2017