cp's OEIS Frontend

A288322 Number of Dyck paths of semilength n such that each positive level has exactly six peaks.

%I A288322 #8 Jun 02 2018 10:37:15
%S A288322 1,0,0,0,0,0,1,0,0,0,0,0,0,7,140,840,2100,2310,924,0,49,2156,42140,
%T A288322 479220,3598560,19184676,75954564,229873063,541427264,1002386336,
%U A288322 1473318476,1876489398,3785310858,20726607804,136977861097,786065454860,3841493284076
%N A288322 Number of Dyck paths of semilength n such that each positive level has exactly six peaks.
%H A288322 Alois P. Heinz, <a href="/A288322/b288322.txt">Table of n, a(n) for n = 0..1000</a>
%H A288322 Wikipedia, <a href="https://en.wikipedia.org/wiki/Lattice_path#Counting_lattice_paths">Counting lattice paths</a>
%p A288322 b:= proc(n, k, j) option remember;
%p A288322      `if`(n=j, 1, add(b(n-j, k, i)*(binomial(i, k)
%p A288322       *binomial(j-1, i-1-k)), i=1..min(j+k, n-j)))
%p A288322     end:
%p A288322 a:= n-> `if`(n=0, 1, b(n, 6$2)):
%p A288322 seq(a(n), n=0..40);
%t A288322 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 A288322 a[n_] := If[n == 0, 1, b[n, 6, 6]];
%t A288322 Table[a[n], {n, 0, 35}] (* _Jean-François Alcover_, Jun 02 2018, from Maple *)
%Y A288322 Column k=6 of A288318.
%Y A288322 Cf. A000108.
%K A288322 nonn
%O A288322 0,14
%A A288322 _Alois P. Heinz_, Jun 07 2017