87261domain: NAppears in sequencesO.g.f. A(x) satisfies: [x^n] exp(x*A(x)) = [x^n] A(x) / n!.at n=5A131310Number T(n,k) of proper 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>=2, 1<=k<=n-1, read by rows.at n=26A320264