Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k (1,0)-steps at level zero. (A Grand Motzkin path is a path in the half-plane x>=0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).).
A109189
Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k (1,0)-steps at level zero. (A Grand Motzkin path is a path in the half-plane x>=0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).).
Terms
- a(0) =1a(1) =0a(2) =1a(3) =2a(4) =0a(5) =1a(6) =2a(7) =4a(8) =0a(9) =1a(10) =8a(11) =4a(12) =6a(13) =0a(14) =1a(15) =16a(16) =20a(17) =6a(18) =8a(19) =0a(20) =1a(21) =46a(22) =40a(23) =36a(24) =8a(25) =10a(26) =0a(27) =1a(28) =114a(29) =128
External references
- oeis: A109189