Triangle read by rows: let T(n,k) (for n >= 0, 0 <= k <= n) be the number of walks from (0,0) to (n,k) using steps (1,1), (1,0), (1,-1) and (0,-1); n-th row of triangle gives T(n,n), T(n,n-1), ..., T(n,0).

A223092

Triangle read by rows: let T(n,k) (for n >= 0, 0 <= k <= n) be the number of walks from (0,0) to (n,k) using steps (1,1), (1,0), (1,-1) and (0,-1); n-th row of triangle gives T(n,n), T(n,n-1), ..., T(n,0).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =7a(6) =1a(7) =6a(8) =18a(9) =29a(10) =1a(11) =8a(12) =33a(13) =86a(14) =133a(15) =1a(16) =10a(17) =52a(18) =179a(19) =431a(20) =650a(21) =1a(22) =12a(23) =75a(24) =316a(25) =978a(26) =2238a(27) =3319a(28) =1a(29) =14

External references