Triangle T(n,k) (n>=0, 0 <= k <= n) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R=(1,0), V=(0,1) and D=(1,2).
A071943
Triangle T(n,k) (n>=0, 0 <= k <= n) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R=(1,0), V=(0,1) and D=(1,2).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =3a(6) =1a(7) =3a(8) =7a(9) =9a(10) =1a(11) =4a(12) =12a(13) =24a(14) =31a(15) =1a(16) =5a(17) =18a(18) =46a(19) =89a(20) =113a(21) =1a(22) =6a(23) =25a(24) =76a(25) =183a(26) =342a(27) =431a(28) =1a(29) =7
External references
- oeis: A071943