1307504

Appears in sequences

• a(n) = binomial coefficient C(n,9).at n=15A000582
• Binomial coefficients C(2n,n-3).at n=9A002696
• Binomial coefficient C(24,n).at n=9A010940
• Binomial coefficient C(24,n).at n=15A010940
• a(n) = binomial(n,15).at n=9A010968
• Number of compositions of n into 10 ordered relatively prime parts.at n=15A023035
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted.at n=19A024753
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted.at n=20A024753
• Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted, duplicates removed.at n=21A024760
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=11A024761
• Number of combinations of n objects taken pi(n) at a time.at n=24A037031
• a(n) = binomial(n, floor((n-5)/2)).at n=24A037953
• a(n) = binomial(n, floor((n-6)/2)).at n=24A037957
• Binomial coefficients C(2*n-8,9).at n=7A053131
• a(n) = binomial(sigma(n), n).at n=14A066090
• a(n) = max{ C(n,0), C(n-1,1), C(n-2,2), ..., C(n-n,n) }.at n=33A073028
• Staircase on Pascal's triangle.at n=15A081181
• Staircase on Pascal's triangle.at n=15A081205
• Triangle read by rows: T(m,n) = binomial(m!,n), m>=0, 0 <= n <= m!.at n=23A105291
• Triangle read by rows: T(m,n) = binomial(m!,n), m>=0, 0 <= n <= m!.at n=29A105291