1918083

Appears in sequences

• Number T(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=42A257740
• Number of multisets of nonempty words with a total of n letters over senary alphabet such that all letters occur at least once in the multiset.at n=2A320216