|
Search: id:A110220
|
|
|
| A110220 |
|
Triangle read by rows: T(n,k) (0<=k<=floor(n/2)) is the number of lattice paths from (0,0) to (2n,0) consisting of steps U=(1,1), D=(1,-1), H=(2,0), never going below the x-axis (i.e. Schroeder paths) and having k UH's. |
|
+0
2
|
|
| 1, 2, 5, 1, 15, 7, 51, 37, 2, 188, 181, 25, 731, 866, 204, 5, 2950, 4124, 1393, 91, 12235, 19657, 8672, 1008, 14, 51822, 93937, 51147, 8856, 336, 223191, 450220, 291470, 68085, 4710, 42, 974427, 2163910, 1622665, 480535, 50655, 1254, 4302645
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Row n has 1+floor(n/2) terms. Row sums yield the large Schroeder numbers (A006318). T(n,0)=A007317(n+1). sum(k*T(n,k),k=0..floor(n/2))=A026002(n-1) for n>=2. T(2n,n)=Cat(n) (the n-th Catalan number; A000108).
|
|
FORMULA
|
G.f.=[1-z-sqrt(1-6z+5z^2-4tz^2)]/[2z(1-z+tz)].
T(n,k)=binomial(n+1,k)*Sum(binomial(n+1-k,k+j+1)*binomial(2j+2k,j), j=0..n-2k)/(n+1). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 28 2007
|
|
EXAMPLE
|
T(3,1)=7 because we have HUHD, UHDH, UHDUD, UHHD, UHUDD, UUHDD and UDUHD.
Triangle starts:
1;
2;
5,1;
15,7;
51,37,2;
188,181,25;
|
|
MAPLE
|
G:=(1-z-sqrt(1-6*z+5*z^2-4*z^2*t))/2/z/(1-z+t*z): Gser:=simplify(series(G, z=0, 15)): P[0]:=1: for n from 1 to 12 do P[n]:=coeff(Gser, z^n) od: for n from 0 to 12 do seq(coeff(t*P[n], t^k), k=1..1+floor(n/2)) od; # yields sequence in triangular form
|
|
CROSSREFS
|
Cf. A006318, A007317, A026002, A000108.
Sequence in context: A101282 A145879 A101895 this_sequence A119518 A111797 A122104
Adjacent sequences: A110217 A110218 A110219 this_sequence A110221 A110222 A110223
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 16 2005
|
|
|
Search completed in 0.005 seconds
|
