A288326 - OEIS

%I #8 Jun 02 2018 10:37:40

%S 1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,11,594,10296,84084,378378,

%T 1009008,1633632,1575288,831402,184756,0,121,13794,686070,19744296,

%U 375698466,5114697588,52484019588,421146343332,2715042399498,14352204442576

%N Number of Dyck paths of semilength n such that each positive level has exactly ten peaks.

%H Alois P. Heinz, <a href="/A288326/b288326.txt">Table of n, a(n) for n = 0..1000</a>

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

%p b:= proc(n, k, j) option remember;

%p      `if`(n=j, 1, add(b(n-j, k, i)*(binomial(i, k)

%p       *binomial(j-1, i-1-k)), i=1..min(j+k, n-j)))

%p     end:

%p a:= n-> `if`(n=0, 1, b(n, 10$2)):

%p seq(a(n), n=0..45);

%t b[n_, k_, j_] := b[n, k, j] = If[n == j, 1, Sum[b[n - j, k, i]*(Binomial[i, k]*Binomial[j - 1, i - 1 - k]), {i, 1, Min[j + k, n - j]}]];

%t a[n_] := If[n == 0, 1, b[n, 10, 10]];

%t Table[a[n], {n, 0, 45}] (* _Jean-François Alcover_, Jun 02 2018, from Maple *)

%Y Column k=10 of A288318.

%Y Cf. A000108.

%K nonn

%O 0,22

%A _Alois P. Heinz_, Jun 07 2017