2940381648
domain: N
Appears in sequences
- Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component by 1 such that for each point (p_1,p_2,...,p_k) we have abs(p_{i}-p_{i+1}) <= 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=48A227655
- Number of lattice paths from {3}^n to {0}^n using steps that decrement one component by 1 such that for each point (p_1,p_2,...,p_n) we have abs(p_{i}-p_{i+1}) <= 1.at n=6A227657
- Number of lattice paths from {n}^6 to {0}^6 using steps that decrement one component by 1 such that for each point (p_1,p_2,...,p_6) we have abs(p_{i}-p_{i+1}) <= 1.at n=3A227668