2220075

Appears in sequences

• a(n) = binomial coefficient C(n,8).at n=19A000581
• a(n) = binomial(3*n, n - 1).at n=8A004319
• Binomial coefficient C(27,n).at n=8A010943
• Binomial coefficient C(27,n).at n=19A010943
• a(n) = binomial(n,19).at n=8A010972
• Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted, duplicates removed.at n=26A024760
• Number of symmetric types of (4,2n)-hypergraphs under action of complementing group C(4,2).at n=21A029941
• a(n) = binomial(2*n+1, n-5).at n=8A030055
• Binomial coefficients C(2*n-7,8).at n=9A053130
• Number of possible games of 10-pin bowling with a total score of n.at n=8A060853
• a(n) = binomial(3^n,2^n).at n=3A086154
• Coordination sequence for 20-dimensional cyclotomic lattice Z[zeta_25].at n=8A126905
• a(n) = binomial(floor((3n+4)/2),floor(n/2)).at n=17A127040
• Triangle read by rows: T(n, k) = binomial(3*n+1-k, n-k) for n, k >= 0.at n=46A144484
• a(n) = Sum_{j=1..floor(n/2)} binomial(n+j-1,j-1).at n=17A175167
• Triangle: T(n,k)=C(4n-1,2k), 0<=k<=n.at n=32A193632
• Number of faces of dimension n in a tight triangulation of the manifold OP^2.at n=7A202289
• a(n) is the maximum value of binomial(n-2*k,k) with 0 <= k <= floor(n/3).at n=43A349862