Triangle T(n,k) 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 = (3,1).
A071946
Triangle T(n,k) 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 = (3,1).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =2a(6) =1a(7) =4a(8) =6a(9) =6a(10) =1a(11) =6a(12) =13a(13) =19a(14) =19a(15) =1a(16) =8a(17) =23a(18) =44a(19) =63a(20) =63a(21) =1a(22) =10a(23) =37a(24) =87a(25) =156a(26) =219a(27) =219a(28) =1a(29) =12
External references
- oeis: A071946