13123110

Appears in sequences

• a(n) = binomial coefficient C(n,10).at n=18A001287
• Binomial coefficient C(2n,n-4).at n=10A004310
• Binomial coefficient C(28,n).at n=10A010944
• Binomial coefficient C(28,n).at n=18A010944
• a(n) = binomial(n,18).at n=10A010971
• Areas of more than one primitive Pythagorean triangle.at n=22A024407
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=18A024762
• Summarize digits of preceding number, by decreasing digit value. Start with a(0) = 0.at n=5A036058
• a(n) = binomial(n, floor((n-7)/2)).at n=28A037954
• a(n) = binomial(n, floor((n-8)/2)).at n=28A037958
• Maximum over k of the largest squarefree number dividing a value of binomial(n,k).at n=27A048681
• Triangle read by rows in which row n contains first n numbers with exactly n distinct prime factors.at n=30A048692
• a(n) = binomial(composite(n), n), where composite = A002808, composite numbers.at n=17A064813
• a(n) = max{ C(n,0), C(n-1,1), C(n-2,2), ..., C(n-n,n) }.at n=38A073028
• Staircase on Pascal's triangle.at n=18A081181
• a(n)=Product[p(n)-j, j=1..n]/n!=A090114(n)/n!.at n=9A090115
• Least area common to n distinct primitive Pythagorean triangles.at n=2A093536
• Row sums of triangle A099575.at n=18A099576
• a(n) = binomial(3*n+1, n+1).at n=9A117671
• Products of 8 distinct primes (squarefree 8-almost primes).at n=2A123322