58905

Appears in sequences

• Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=36A000332
• Number of compositions of n into 5 ordered relatively prime parts.at n=32A000743
• Binomial coefficient C(3n,n-8).at n=4A004326
• Binomial coefficient C(4n,n-5).at n=4A004335
• Binomial coefficient C(6n,n-2).at n=4A004357
• Binomial coefficient C(36,n).at n=4A010952
• Binomial coefficient C(n,32).at n=4A010985
• Maximal value of products of partitions of n into powers of distinct primes (powers of 1 and 2 excluded).at n=49A051704
• Binomial coefficients C(2*n+4,4).at n=16A053134
• Reduced denominators of the coefficients in a series expansion for Gamma[x].at n=31A054380
• a(n) = binomial(4*n,4).at n=8A060541
• Number of pentagonal regions in regular n-gon with all diagonals drawn.at n=50A067152
• a(n) = binomial(sigma(n),tau(n)), where sigma(n) is the sum and tau(n) the number of divisors of n (A000203, A000005).at n=21A068904
• a(n) = (2^(n-1)/(2n)!)*Product_{k=1..n} q(k) where q(n) is the denominator of B(2n), the 2n-th Bernoulli number.at n=15A069267
• a(n) = binomial(sigma(n+1), sigma(n)).at n=20A078504
• Triangle read by rows: T(n,k) = binomial(n^2, k), 0 <= k <= n.at n=25A090642
• Where record values of A119791 occur.at n=30A119793
• Triangle T(n, k) = binomial((n-k)^2, k^2) read by rows.at n=38A123163
• Triangular array T(n,k) giving number of 3-connected graphs with n labeled nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n(n-1)/2).at n=13A123542
• Triangle, read by rows, where T(n,k) = C( C(n+2,3) - C(k+2,3) + 2, n-k) for n>=k>=0.at n=16A126454