301064

Appears in sequences

• Exponential generating function x*exp(x/(1-x)).at n=7A006152
• a(n) = Sum_{k=0..n} (k+1) * A026670(n, k).at n=14A026985
• Exponential Riordan array [e^(x/(1-x)),x].at n=37A129652
• Triangular array read by rows. T(n,k) is the number of partial permutations (injective partial functions) of {1,2,...,n} that have exactly k elements in a cycle. The k elements are not necessarily in the same cycle. A fixed point is considered to be in a cycle.at n=37A206703
• Number 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=35A320264