1905120

Appears in sequences

• Differences of 0: 6!*Stirling2(n,6).at n=8A000920
• Coefficients of Laguerre polynomials.at n=5A001811
• Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).at n=41A019538
• Triangle of coefficients of Laguerre polynomials L_n(x) (powers of x in decreasing order).at n=50A021010
• a(n) = n^2*(n+1)*(n+3)!/48.at n=6A037961
• Number of primitive (aperiodic) words of length n which contain exactly six different symbols.at n=8A056271
• Palindromes using exactly six different symbols.at n=16A056457
• Palindromes using exactly six different symbols.at n=17A056457
• Number of primitive (aperiodic) palindromes using exactly six different symbols.at n=16A056467
• Number of primitive (aperiodic) palindromes using exactly six different symbols.at n=17A056467
• Number of periodic palindromes using exactly six different symbols.at n=16A056492
• Number of primitive (period n) periodic palindromes using exactly six different symbols.at n=16A056502
• n*(n+1)^2*(n+2)*(n+3)^2*(n+4).at n=6A057666
• Triangle of coefficients of Bateman polynomial n!Z_n(-x).at n=30A073768
• 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=39A090582
• 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=51A131689
• 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=41A139359
• Triangle T(n, k) = binomial(n, k)*( n!/k! if floor(n/2) >= k otherwise n!/(n-k)! ), read by rows.at n=49A174298
• Triangle T(n, k) = binomial(n, k)*( n!/k! if floor(n/2) >= k otherwise n!/(n-k)! ), read by rows.at n=50A174298
• Triangle T(n, k, q) = n!*(n+1)!*q^k/((n-k)!(n-k+1)!) if floor(n/2) > k-1, otherwise n!*(n+1)!*q^(n-k)/(k!*(k+1)!) for q = 3, read by rows.at n=31A174451