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.
%I A287967 #9 Mar 04 2024 14:58:16 %S A287967 1,1,2,5,13,40,119,376,1202,3916,12920,42974,143989,485623,1646056, %T A287967 5601850,19127858,65491001,224750426,772816118,2661800949,9180835248, %U A287967 31703037147,109586025511,379124973003,1312592051481,4547284385059,15761969520682,54660238286990 %N A287967 Number of Dyck paths of semilength n such that no level has more than three peaks. %H A287967 Alois P. Heinz, <a href="/A287967/b287967.txt">Table of n, a(n) for n = 0..1000</a> %H A287967 Manosij Ghosh Dastidar and Michael Wallner, <a href="https://arxiv.org/abs/2402.17849">Bijections and congruences involving lattice paths and integer compositions</a>, arXiv:2402.17849 [math.CO], 2024. See p. 19. %H A287967 Wikipedia, <a href="https://en.wikipedia.org/wiki/Lattice_path#Counting_lattice_paths">Counting lattice paths</a> %F A287967 a(n) = A287847(n,3). %F A287967 a(n) = A000108(n) for n <= 3. %Y A287967 Column k=3 of A287847. %Y A287967 Cf. A000108. %K A287967 nonn %O A287967 0,3 %A A287967 _Alois P. Heinz_, Jun 03 2017