76904685

Appears in sequences

• a(n) = binomial coefficient C(n,8).at n=32A000581
• Binomial coefficients binomial(5n,n).at n=8A001449
• Binomial coefficient C(2n,n-12).at n=8A004318
• a(n) = C(4n,n-2).at n=8A004332
• Binomial coefficient C(40,n).at n=8A010956
• Binomial coefficient C(n,32).at n=8A010985
• a(n) = binomial(n, floor(n/5)).at n=40A051052
• Binomial coefficients C(2*n+8,8).at n=16A053137
• Triangle read by rows: T(n,k) = binomial(k*n,n), 1 <= k <= n.at n=32A096130
• a(n) = binomial(n, d(n)), where d(n) = A000005(n) is the number of divisors of n.at n=39A204292
• Number of nonnegative integer arrays of length n summing to n without equal adjacent values modulo 2.at n=32A221315
• Triangle T(n,k) = binomial(5*n - 4*k, 4*n - 3*k), 0 <= k <= n.at n=36A264774
• a(n) = binomial(n, 2^floor(log_2(n))).at n=39A291665