A112307 Triangle read by rows: T(n,k) is number of Dyck paths of semilength n with height of second peak equal to k (n>=1; 0<=k<=n-1).
1, 1, 1, 1, 2, 2, 1, 4, 6, 3, 1, 9, 16, 12, 4, 1, 23, 44, 39, 20, 5, 1, 65, 128, 123, 76, 30, 6, 1, 197, 392, 393, 268, 130, 42, 7, 1, 626, 1250, 1284, 928, 505, 204, 56, 8, 1, 2056, 4110, 4287, 3216, 1880, 864, 301, 72, 9, 1, 6918, 13834, 14583, 11224, 6885, 3438, 1379
Offset: 1
Examples
T(4,1)=4 because we have UDUDUDUD, UDUDUUDD, UUDDUDUD and UUUDDDUD, where U=(1,1), D=(1,-1). Triangle begins: 1; 1,1; 1,2,2; 1,4,6,3; 1,9,16,12,4;
Programs
-
Maple
G:=((1-t*z*c)^2+t*z^2*c)/(1-z)/(1-t*z*c)^2-1: c:=(1-sqrt(1-4*z))/2/z: Gser:=simplify(series(G,z=0,15)): for n from 1 to 12 do P[n]:=coeff(Gser,z^n) od: for n from 1 to 12 do seq(coeff(t*P[n],t^j),j=1..n) od; # yields sequence in triangular form
Formula
G.f.=[(1-tzc)^2+tz^2*c]/[(1-z)(1-tzc)^2]-1, where c=[1-sqrt(1-4z)]/(2z) is the Catalan function.
Comments