login
Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals nine.
2

%I #5 Jun 13 2017 12:07:07

%S 1,0,0,0,0,0,0,0,0,0,10,461,7205,57165,277705,931347,2377374,5076785,

%T 9930755,19006525,36578245,71039375,139303141,283400392,719003238,

%U 3354487012,24605098028,182759086971,1191293398162,6729538338238,33388441276835,147969800303361

%N Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals nine.

%H Alois P. Heinz, <a href="/A288548/b288548.txt">Table of n, a(n) for n = 9..300</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Lattice_path#Counting_lattice_paths">Counting lattice paths</a>

%Y Column k=9 of A288387.

%Y Cf. A000108.

%K nonn

%O 9,11

%A _Alois P. Heinz_, Jun 11 2017