8436285

Appears in sequences

• a(n) = binomial coefficient C(n,10).at n=17A001287
• Binomial coefficient C(27,n).at n=10A010943
• Binomial coefficient C(27,n).at n=17A010943
• a(n) = binomial(n,17).at n=10A010970
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=25A024754
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=26A024754
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=25A024761
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=14A024762
• a(n) = binomial(2n+1,n-3).at n=10A030053
• a(n) = binomial(n, floor((n-7)/2)).at n=27A037954
• a(n) = binomial(n, floor((n-6)/2)).at n=27A037957
• a(n) = binomial(composite(n), n), where composite = A002808, composite numbers.at n=16A064813
• a(n) = max{ C(n,0), C(n-1,1), C(n-2,2), ..., C(n-n,n) }.at n=37A073028
• Staircase on Pascal's triangle.at n=17A081181
• Staircase on Pascal's triangle.at n=17A081205
• a(n) = binomial(floor(n*(sqrt(5)+1)/2), n) for n>=0.at n=17A135962
• Triangle: T(n,k)=C(4n-1,2k), 0<=k<=n.at n=33A193632
• Binomial coefficients C(2*n-9,10).at n=8A196790
• Number of compositions of n in which the minimal multiplicity of parts equals 10.at n=27A244173
• Number of permutations of zero-one words with A056576(n)-n zeros and n-1 ones.at n=17A293308