|
%I #19 Jun 02 2018 10:38:19
%S 1,1,3,26,425,10647,365512,16067454,864721566,55202528425,
%T 4083666929771,343854336973368,32493430569907125,3406873823160467912,
%U 392619681705581846700,49342834390595374213214,6717520607597479710109299,984991858956314599670220717,154785386247352261724279606367
%N Number of Dyck paths whose sequence of ascent lengths is exactly n+1, n+2, ..., 2n.
%C Dyck paths counted by a(n) have semilength (3*n^2 + n)/2 = A005449(n) and length A049451(n).
%H Alois P. Heinz, <a href="/A300954/b300954.txt">Table of n, a(n) for n = 0..150</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Lattice_path#Counting_lattice_paths">Counting lattice paths</a>
%F a(n) = A107876(2n,n).
%e a(0) = 1: the empty path.
%e a(1) = 1: uudd.
%e a(2) = 3: uuuduuuudddddd, uuudduuuuddddd, uuuddduuuudddd.
%p a:= proc(m) option remember; local b; b:=
%p proc(n, i) option remember; `if`(i>=2*m, 1,
%p add(b(n+i-j, i+1), j=1..n+i))
%p end; b(0, m+1)
%p end:
%p seq(a(n), n=0..20);
%t a[m_] := a[m] = Module[{b}, b[n_, i_] := b[n, i] = If[i >= 2m, 1, Sum[b[n + i - j, i + 1], {j, 1, n + i}]]; b[0, m + 1]];
%t Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, Jun 02 2018, from Maple *)
%Y Main diagonal of A107876.
%Y Cf. A005449, A049451.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Mar 16 2018
|
