1304045

Appears in sequences

• 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.at n=39A210472
• Number of paths starting at {3}^n to a border position where one component equals 0 using steps that decrement one component by 1.at n=5A210486