30260340

Appears in sequences

• a(n) = binomial coefficient C(n,8).at n=28A000581
• a(n) = binomial coefficient C(2n, n-10).at n=8A004316
• Binomial coefficient C(3n,n-4).at n=8A004322
• Binomial coefficient C(4n,n-1).at n=8A004331
• Binomial coefficient C(36,n).at n=8A010952
• Binomial coefficient C(n,28).at n=8A010981
• a(n) = binomial(n*(n+1)/2, n).at n=8A014068
• Number of compositions of n into 9 ordered relatively prime parts.at n=28A023034
• Binomial coefficients C(2*n+8,8).at n=14A053137
• Triangle, read by rows, where T(n,k) = C(n*(n-1)/2 - k*(k-1)/2 + n-k, n-k).at n=36A107862
• Triangle T(n, k) = binomial(n*(n+1)/2 + k, k), read by rows.at n=44A176566
• Triangle T(n,m) = binomial(4*n, 4*m), 0 <= m <= n, read by rows.at n=47A177808
• Triangle T(n,m) = binomial(4*n, 4*m), 0 <= m <= n, read by rows.at n=52A177808
• a(n) = binomial(n, A002024(n+1)-1) where A002024 is "n appears n times".at n=36A180272
• Triangle defined by T(n,k) = binomial(n^2, (n-k)*k), for n>=0, k=0..n, as read by rows.at n=23A228836
• Triangle defined by T(n,k) = binomial(n^2, (n-k)*k), for n>=0, k=0..n, as read by rows.at n=25A228836
• Number of subsets of [n] in which exactly half of the elements are Fibonacci numbers.at n=36A357927
• a(n) is the number of positive integers that have n prime factors and these are all <= n.at n=27A377537