6906900

Appears in sequences

• a(n) = binomial coefficient C(n,9).at n=19A000582
• Binomial coefficient C(2n,n-5).at n=9A004311
• Binomial coefficient C(28,n).at n=9A010944
• Binomial coefficient C(28,n).at n=19A010944
• a(n) = binomial(n,19).at n=9A010972
• Number of compositions of n into 10 ordered relatively prime parts.at n=19A023035
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=23A024761
• Number of combinations of n objects taken pi(n) at a time.at n=28A037031
• a(n) = binomial(3*n+1,n).at n=9A045721
• a(n) = binomial(n, floor(n/3)).at n=28A051033
• Partial sums of A050483.at n=19A052181
• Binomial coefficients C(2*n-8,9).at n=9A053131
• Number of possible games of 10-pin bowling with a total score of n.at n=9A060853
• Central column of triangle A065941.at n=19A065942
• a(n) = binomial(floor((3n+2)/2), floor(n/2)).at n=18A099578
• Triangle read by rows: T(n,k) is the number of nonroot nodes of outdegree k (0<=k<=n-1) in all non-crossing trees with n edges.at n=45A100400
• Number of compositions (ordered partitions) of the n-th prime into n positive integers.at n=9A104861
• Coordination sequence for 20-dimensional cyclotomic lattice Z[zeta_25].at n=9A126905
• a(n) = (1/10)*(2^(4*n-1)-5^n*L(2*n)+L(4*n)), where L() = Lucas numbers A000032.at n=6A133415
• Triangle read by rows: T(n, k) = binomial(3*n+1-k, n-k) for n, k >= 0.at n=45A144484