3124550

Appears in sequences

• a(n) = binomial coefficient C(n,9).at n=17A000582
• Binomial coefficient C(2n,n-4).at n=9A004310
• Binomial coefficient C(26,n).at n=9A010942
• Binomial coefficient C(26,n).at n=17A010942
• a(n) = binomial(n,17).at n=9A010970
• Number of compositions of n into 10 ordered relatively prime parts.at n=17A023035
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=17A024761
• Number of combinations of n objects taken pi(n) at a time.at n=26A037031
• a(n) = binomial(n, floor((n-7)/2)).at n=26A037954
• a(n) = binomial(n, floor((n-8)/2)).at n=26A037958
• Binomial coefficients C(2*n-8,9).at n=8A053131
• a(n) = lcm(1,2,...,2*n) / (n*binomial(2*n, n)).at n=26A068553
• Staircase on Pascal's triangle.at n=17A081204
• a(n) = lcm(1,...,2n+4)/((n+1)*binomial(2n+2, n+1)).at n=26A119636
• Number of compositions (= ordered integer partitions) of n into 2n parts.at n=9A165817
• Cardinality of the smallest nonempty class of length minimal languages with exactly n nonempty words each over a countably infinite alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=26A291057
• Cardinality of the smallest nonempty class of length minimal languages with exactly n nonempty words each over a countably infinite alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=34A291057
• a(n) is the maximum value of binomial(n-2*k,k) with 0 <= k <= floor(n/3).at n=44A349862
• Triangle read by rows. T(n, k) = binomial(3*n - 1, 3*k - 1).at n=41A361949