|
%I #7 Jun 11 2017 18:19:18
%S 1,0,2,5,13,35,112,368,1208,3992,13449,46187,160804,565535,2005796,
%T 7168058,25793100,93388250,340005973,1244062960,4572478054,
%U 16874672868,62508259095,232338076267,866289458048,3239350667761,12145345634715,45649270140732
%N Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals one.
%H Alois P. Heinz, <a href="/A288540/b288540.txt">Table of n, a(n) for n = 1..300</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Lattice_path#Counting_lattice_paths">Counting lattice paths</a>
%e : a(3) = 2:
%e :
%e : /\ /\
%e : /\/ \ / \/\ .
%Y Column k=1 of A288387.
%Y Cf. A000108.
%K nonn
%O 1,3
%A _Alois P. Heinz_, Jun 11 2017
|
