203374081

Appears in sequences

• Number of 3-packed words of degree n.at n=5A243664
• Number of m-shape ordered set partitions, square array read by ascending antidiagonals, A(m, n) for m, n >= 0.at n=41A260883
• Triangle read by rows, T(n, k) = A243664(n) * binomial(n, k).at n=15A362849
• Triangle read by rows, T(n, k) = A243664(n) * binomial(n, k).at n=20A362849