4686825

Appears in sequences

• a(n) = binomial coefficient C(n,9).at n=18A000582
• a(n) = binomial(3n,n).at n=9A005809
• Binomial coefficient C(27,n).at n=9A010943
• Binomial coefficient C(27,n).at n=18A010943
• a(n) = binomial(n,18).at n=9A010971
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=20A024761
• a(n) = binomial(2n+1,n-4).at n=9A030054
• Number of combinations of n objects taken pi(n) at a time.at n=27A037031
• a(n) = binomial(n, floor((n-8)/2)).at n=27A037958
• a(n) = binomial(n, floor(n/3)).at n=27A051033
• Binomial coefficients C(2*n+9,9).at n=9A053138
• Central column of triangle A065941.at n=18A065942
• Binomial(n, phi(n)), where phi(n) is the Euler totient function.at n=26A066449
• a(n) = binomial(n^3, n^2).at n=2A066789
• Staircase on Pascal's triangle.at n=18A081204
• Triangle read by rows: T(n,k) = binomial(k*n,n), 1 <= k <= n.at n=38A096130
• Triangle read by rows in which the r-th term of the n-th row is C(n^r,r*n), where r = 1 to n.at n=5A096132
• Triangle read by rows: T(n,k) = binomial(3*n-k,n-k).at n=45A119301
• a(n) = binomial(n, sum_digits_n).at n=27A128936
• Triangle read by rows: binomial(3*n,3*k), 0 <= k <= n.at n=48A139459