Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component such that for each point (p_1,p_2,...,p_k) we have p_1<=p_2<=...<=p_k; square array A(n,k), n>=0, k>=0, read by antidiagonals.
A227578
Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component such that for each point (p_1,p_2,...,p_k) we have p_1<=p_2<=...<=p_k; square array A(n,k), n>=0, k>=0, read by antidiagonals.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =2a(9) =1a(10) =1a(11) =1a(12) =5a(13) =4a(14) =1a(15) =1a(16) =1a(17) =14a(18) =29a(19) =8a(20) =1a(21) =1a(22) =1a(23) =42a(24) =290a(25) =185a(26) =16a(27) =1a(28) =1a(29) =1
External references
- oeis: A227578