29635200

Appears in sequences

• Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).at n=51A019538
• a(n) = n^2*(n+1)*(n+3)!/48.at n=7A037961
• Triangle of labeled mobiles (circular rooted trees) with n nodes and k leaves.at n=39A055349
• Number of labeled mobiles (circular rooted trees) with n nodes and 4 leaves.at n=4A055351
• 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=48A090582
• Number of surjections from an n-element set onto a seven-element set.at n=3A135456
• Triangle read by rows: T(n,k) (n>=1, 4<=k<=n+3) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are of a color seen previously in the sequence.at n=27A292879
• Coreful 4-abundant numbers: numbers k such that csigma(k) > 4*k, where csigma(k) is the sum of the coreful divisors of k (A057723).at n=7A340110