139258

Appears in sequences

• Number of multisets of nonempty words with a total of n letters over ternary alphabet containing the third letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=10A293798
• 4-parking triangle T(r, i, 4) read by rows: T(r, i, k) = (r + 1)^(i-1)*binomial(k*(r + 1) + r - i - 1, r - i) with k = 4 and 0 <= i <= r.at n=25A329060