Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 or from the line y = x-1 (i.e., E steps from the line y = x+1 to the line y = x or N steps from the line y = x-1 to the line y = x).

A110107

Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 or from the line y = x-1 (i.e., E steps from the line y = x+1 to the line y = x or N steps from the line y = x-1 to the line y = x).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =1a(4) =8a(5) =4a(6) =1a(7) =26a(8) =28a(9) =8a(10) =1a(11) =88a(12) =136a(13) =80a(14) =16a(15) =1a(16) =330a(17) =600a(18) =512a(19) =208a(20) =32a(21) =1a(22) =1360a(23) =2636a(24) =2768a(25) =1648a(26) =512a(27) =64a(28) =1a(29) =6002

External references