1538743249

Appears in sequences

• Number of paths from (0,0,0) to (n,n,n) such that at each step (i) at least one coordinate increases, (ii) no coordinate decreases, (iii) no coordinate increases by more than 1 and (iv) all coordinates are integers.at n=6A126086
• Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one or more components by one; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=51A262809
• Number of lattice paths from {6}^n to {0}^n using steps that decrement one or more components by one.at n=3A263062