

A114691


Triangle read by rows: T(n,k) is the number of hillfree Schroeder paths of length 2n that have k weak ascents (1<=k<=n1 for n>=2; k=1 for n=1). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,1) and H=(2,0) steps and never going below the xaxis. A hill is a peak at height 1. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.


0



1, 3, 7, 4, 15, 26, 4, 31, 108, 54, 4, 63, 366, 380, 90, 4, 127, 1104, 1950, 960, 134, 4, 255, 3090, 8284, 6966, 2008, 186, 4, 511, 8212, 31030, 39780, 19550, 3716, 246, 4, 1023, 21014, 106252, 192802, 144472, 46670, 6308, 314, 4, 2047, 52248, 340190
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Row n contains n1 terms (n>=2). Row sums are the little Schroeder numbers (A001003).


LINKS



FORMULA

G.f.=G=z(t+H)/(1zzH), where H is given by H =z(2+H)(t+H).


EXAMPLE

T(3,2)=4 because we have (UH)D(H),(UU)DD(H),(UU)D(H)D and (UU)D(U)DD, where U=(1,1), D=(1,1) and H=(2,0) (the weak ascents are shown between parentheses).
Triangle starts:
1;
3;
7,4;
15,26,4;
31,108,54,4;


MAPLE

H:=(1z*t2*zsqrt(12*z*t4*z+z^2*t^24*z^2*t+4*z^2))/2/z: G:=z*(t+H)/(1zz*H): Gser:=simplify(series(G, z=0, 15)): for n from 1 to 11 do P[n]:=coeff(Gser, z^n) od: 1; for n from 2 to 11 do seq(coeff(P[n], t^j), j=1..n1) od; # yields sequence in triangular form


CROSSREFS



KEYWORD

nonn,tabf


AUTHOR



STATUS

approved



