426405

Appears in sequences

• Triangle T(n,d) read by rows: Number of ascent sequences of length n with d zeros.at n=57A175579
• Number of 3-packed words of degree n.at n=4A243664
• Number of m-shape ordered set partitions, square array read by ascending antidiagonals, A(m, n) for m, n >= 0.at n=32A260883
• Triangle read by rows, T(n, k) = A243664(n) * binomial(n, k).at n=10A362849
• Triangle read by rows, T(n, k) = A243664(n) * binomial(n, k).at n=14A362849