20058300

Appears in sequences

• a(n) = binomial(n, floor(n/2)).at n=27A001405
• a(n) = binomial(2*n+1, n+1): number of ways to put n+1 indistinguishable balls into n+1 distinguishable boxes = number of (n+1)-st degree monomials in n+1 variables = number of monotone maps from 1..n+1 to 1..n+1.at n=13A001700
• Least integer having Radon random number n.at n=26A002661
• Valence of graph of maximal intersecting families of sets.at n=26A007007
• Binomial coefficient C(27,n).at n=13A010943
• Binomial coefficient C(27,n).at n=14A010943
• a(n) = binomial(n,13).at n=14A010966
• a(n) = binomial coefficient C(n,14).at n=13A010967
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=21A024762
• a(n) = binomial(n, floor((n-1)/2)).at n=27A037952
• GCD of consecutive central binomial coefficients: a(n) = gcd(A001405(n+1), A001405(n)).at n=27A057977
• Smallest number of crossing-free matchings on n points in the plane.at n=26A063549
• a(1) = 1. a(n) = n*a(n-1) if gcd(n,a(n-1)) = 1, a(n-1)/n if n divides a(n-1), otherwise a(n) = a(n-1).at n=26A068629
• a(1) = 1. a(n) = n*a(n-1) if gcd(n,a(n-1)) = 1, a(n-1)/n if n divides a(n-1), otherwise a(n) = a(n-1).at n=27A068629
• Total number of leaves in all rooted ordered trees with n edges.at n=14A088218
• Bisection of A001700.at n=6A100033
• Expansion of (1+x*c(x^2))^3/sqrt(1-4*x^2), c(x) the g.f. of A000108.at n=25A107232
• a(n) = binomial(2*n-1, n)*(-1)^n.at n=14A110556
• Binomial coefficients C(2n+1,n) repeated.at n=26A128015
• Binomial coefficients C(2n+1,n) repeated.at n=27A128015