A110121 Triangle read by rows: T(n,k) (0 <= k <= floor(n/2)) is the number of Delannoy paths of length n, having k EE's crossing the line y = x (i.e., two consecutive E steps from the line y = x+1 to the line y = x-1).
1, 3, 12, 1, 53, 10, 247, 73, 1, 1192, 474, 17, 5897, 2908, 183, 1, 29723, 17290, 1602, 24, 152020, 100891, 12475, 342, 1, 786733, 581814, 90205, 3780, 31, 4111295, 3329507, 620243, 35857, 550, 1, 21661168, 18956564, 4114406, 307192, 7351, 38
Offset: 0
Examples
T(2,0)=12 because, among the 13 (=A001850(2)) Delannoy paths of length 2, only NEEN has an EE crossing the line y=x.
Triangle begins:
1;
3;
12, 1;
53, 10;
247, 73, 1;
Links
- Jinyuan Wang, Rows n = 0..50 of triangle, flattened
- Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger, Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata, Laboratoire d'Informatique de Paris Nord (LIPN 2019).
- R. A. Sulanke, Objects counted by the central Delannoy numbers, J. Integer Seq. 6 (2003), no. 1, Article 03.1.5.
Programs
-
Maple
R:=(1-z-sqrt(1-6*z+z^2))/2/z: G:=1/((1-z*R)^2-z-t*z^2*R^2): 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
-
Mathematica
nmax = 11; r := (1 - z - Sqrt[1 - 6*z + z^2])/2/z; g := 1/((1 - z*r)^2 - z - t*z^2*r^2); gser = Series[g, {z, 0, nmax}]; p[0] = 1; Do[ p[n] = Coefficient[ gser, z, n] , {n, 1, nmax}]; row[n_] := Table[ Coefficient[ t*p[n], t, k], {k, 1, 1 + Floor[n/2]}]; Flatten[ Table[ row[n], {n, 0, nmax}]] (* Jean-François Alcover, Dec 07 2011, after Maple *)
Comments