A110169 Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n that start with exactly k (1,1) steps.
1, 2, 1, 10, 2, 1, 50, 10, 2, 1, 258, 50, 10, 2, 1, 1362, 258, 50, 10, 2, 1, 7306, 1362, 258, 50, 10, 2, 1, 39650, 7306, 1362, 258, 50, 10, 2, 1, 217090, 39650, 7306, 1362, 258, 50, 10, 2, 1, 1196834, 217090, 39650, 7306, 1362, 258, 50, 10, 2, 1, 6634890, 1196834
Offset: 0
Examples
T(3,2)=2 because we have DDNE and DDEN. Triangle starts: 1; 2,1; 10,2,1; 50,10,2,1; 258,50,10,2,1;
Links
- Robert A. Sulanke, Objects Counted by the Central Delannoy Numbers, Journal of Integer Sequences, Volume 6, 2003, Article 03.1.5.
Programs
-
Maple
with(orthopoly): S:=proc(n,k) if k
Formula
Extensions
Keyword tabf changed to tabl by Michel Marcus, Apr 09 2013
Comments