5103000
domain: N
Appears in sequences
- Number of labeled ordered set partitions into 5 parts for n>=1, a(0)=1.at n=10A001118
- Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).at n=49A019538
- a(n) = n^2*(n+1)*(3*n^2 + 7*n - 2)*(n+5)!/11520.at n=5A037963
- Number of palindromes of length n using exactly five different symbols.at n=18A056456
- Number of palindromes of length n using exactly five different symbols.at n=19A056456
- Number of primitive (aperiodic) palindromes using exactly five different symbols.at n=18A056466
- Number of periodic palindromes using exactly five different symbols.at n=18A056491
- Number of primitive (period n) periodic palindromes using exactly five different symbols.at n=18A056501
- 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=50A090582
- Number of sequences over the alphabet of n symbols of length 2n which have n distinct symbols. Also number of placements of 2n balls into n cells where no cell is empty.at n=4A210029
- a(n) = Stirling2(n, floor(n/2)) * floor(n/2)!.at n=10A344397
- a(n) = (n!)^2 * Sum_{k=0..floor(n/2)} 1 / ((n-2*k)! * 4^k * k!).at n=8A346224