834120

Appears in sequences

• Number of labeled ordered set partitions into 5 parts for n>=1, a(0)=1.at n=9A001118
• Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).at n=40A019538
• a(n) = n*(15*n^3 + 30*n^2 + 5*n - 2)*(n+4)!/5760.at n=5A037962
• Number of primitive (aperiodic) words of length n which contain exactly five different symbols.at n=8A056270
• Number of palindromes of length n using exactly five different symbols.at n=16A056456
• Number of palindromes of length n using exactly five different symbols.at n=17A056456
• Number of primitive (aperiodic) palindromes using exactly five different symbols.at n=16A056466
• Number of periodic palindromes using exactly five different symbols.at n=16A056491
• Number of primitive (period n) periodic palindromes using exactly five different symbols.at n=16A056501
• T(n, k) = Sum_{j=0..n-k} (-1)^j*binomial(n - k + 1, j)*(n - k + 1 - j)^n. Triangle read by rows, T(n, k) for 1 <= k <= n.at n=40A090582
• Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n.at n=50A131689
• Number L([n],m) of ways the labeled parts of each integer partition of n can be distributed into m nonempty labeled boxes.at n=40A139359
• Central terms of triangles A019538 and A090582.at n=4A233734
• Coefficients of the signed Fubini polynomials in ascending order, F_n(x) = Sum_{k=0..n} (-1)^n*Stirling2(n,k)*k!*(-x)^k.at n=50A278075
• Expansion of e.g.f. 1/(1 - (exp(x) - 1)^5).at n=9A373940
• Expansion of e.g.f. exp((exp(x) - 1)^5).at n=9A375773
• Triangle Read by rows: T(n,k) is the number of rooted ordered trees with n non-root nodes with non-root node labels in {1,..,k} such that all labels appear at least once in all groups of sibling nodes.at n=50A385123