10015005

Appears in sequences

• a(n) = binomial coefficient C(n,9).at n=20A000582
• a(n) = 10*binomial(2*n + 1, n - 4)/(n + 6).at n=10A003519
• Binomial coefficient C(29,n).at n=9A010945
• Binomial coefficient C(29,n).at n=20A010945
• a(n) = binomial(n,20).at n=9A010973
• a(n) = binomial(3n-1, n-1).at n=10A025174
• a(n) = binomial(2*n+1, n-5).at n=9A030055
• a(n) = binomial(n, floor(n/3)).at n=29A051033
• Binomial coefficients C(2*n+9,9).at n=10A053138
• a(n) = binomial(floor((3n+2)/2), floor(n/2)).at n=19A099578
• a(1) = 1; a(2) = 0; a(3) = 0; a(4) = 0; a(5) = 0; a(6) = 0; a(7) = 0; a(8) = 0; a(9) = 0; a(10) = 0; a(n) = a(n - 1) + 9a(n - 2) - 8a(n - 3) - 28a(n - 4) + 21a(n - 5) + 35a(n - 6) - 20a(n - 7) - 15a(n - 8) + 5a(n - 9) + a(n - 10) for n >= 11.at n=30A122602
• a(n) = binomial(floor((3n+4)/2),floor(n/2)).at n=18A127040
• Least k such that the x^n coefficient of cyclotomic polynomial Phi(k,x) has the largest possible magnitude.at n=35A138475
• Series reversion of x-x^3-x^4.at n=19A217358
• Number of ballot sequences of length n having 10 largest parts.at n=19A244107
• a(n) = Sum_{k=0..10} binomial(20,k)*binomial(n,k).at n=9A247615
• a(n) = binomial(6*n,2*n)/3, n>0, a(0)=1.at n=5A259613
• Number of n-member subsets of [3*n] whose elements sum to a multiple of three.at n=10A318591
• Number of 10-member subsets of [10*n] whose elements sum to a multiple of n.at n=3A318631
• a(n) is the maximum value of binomial(n-2*k,k) with 0 <= k <= floor(n/3).at n=47A349862