Path-counting array T; each step of a path is (1 right) or (1 up) to a point below line y=x, else (1 right and 1 up) or (1 up) to a point on the line y=x, else (1 left) or (1 up) to a point above line y=x. T(i,j)=number of paths to point (i-j,j), for 1<=j<=i, i >= 1.

A055450

Path-counting array T; each step of a path is (1 right) or (1 up) to a point below line y=x, else (1 right and 1 up) or (1 up) to a point on the line y=x, else (1 left) or (1 up) to a point above line y=x. T(i,j)=number of paths to point (i-j,j), for 1<=j<=i, i >= 1.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =1a(4) =2a(5) =10a(6) =1a(7) =3a(8) =7a(9) =36a(10) =1a(11) =4a(12) =5a(13) =26a(14) =137a(15) =1a(16) =5a(17) =9a(18) =19a(19) =101a(20) =543a(21) =1a(22) =6a(23) =14a(24) =14a(25) =75a(26) =406a(27) =2219a(28) =1a(29) =7

External references