OFFSET
0,3
COMMENTS
Sum of entries in row n is A051286(n).
REFERENCES
M. Bona and A. Knopfmacher, On the probability that certain compositions have the same number of parts, Ann. Comb., 14 (2010), 291-306.
E. Munarini, N. Zagaglia Salvi, On the rank polynomial of the lattice of order ideals of fences and crowns, Discrete Mathematics 259 (2002), 163-177.
FORMULA
T(n,0) = A000045(n+1) (the Fibonacci numbers).
Sum_{k=0..n} k*T(n,k) = A182881(n).
G.f.: G(t,z) = 1/sqrt(1 - 2*z - z^2 + 2*z^3 + z^4 - 4*t*z^3).
The g.f. of column k is binomial(2n,n)*z^(3n)/(1-z-z^2)^(2n+1).
Apparently, T(n,1) = 2*A001628(n-3), T(n,2) = 6*A001873(n-6), T(n,3) = 20*A001875(n-9). - R. J. Mathar, Dec 11 2010
EXAMPLE
T(3,1)=2. Indeed, denoting by h (H) the (1,0)-step of weight 1 (2), and u=(1,1), d=(1,-1), the five paths of weight 3 are ud, du, hH, Hh, and hhh; two of them, ud and du, have exactly one u step.
Triangle starts:
1;
1;
2;
3, 2;
5, 6;
8, 18;
13, 44, 6;
MAPLE
G:=1/sqrt(1-2*z-z^2+2*z^3+z^4-4*t*z^3): Gser:=simplify(series(G, z=0, 18)): for n from 0 to 16 do P[n]:=sort(coeff(Gser, z, n)) od: for n from 0 to 16 do seq(coeff(P[n], t, k), k=0..floor(n/3)) od; # yields sequence in triangular form
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Emeric Deutsch, Dec 11 2010
STATUS
approved