Number A(n,k) of paths starting at {n}^k to a border position where one component equals 0 using steps that decrement one component by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.
A210472
Number A(n,k) of paths starting at {n}^k to a border position where one component equals 0 using steps that decrement one component by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.
Terms
- a(0) =0a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =2a(8) =1a(9) =0a(10) =1a(11) =3a(12) =6a(13) =1a(14) =0a(15) =1a(16) =4a(17) =33a(18) =20a(19) =1a(20) =0a(21) =1a(22) =5a(23) =196a(24) =543a(25) =70a(26) =1a(27) =0a(28) =1a(29) =6
External references
- oeis: A210472