77558760

Appears in sequences

• a(n) = binomial(n, floor(n/2)).at n=29A001405
• 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=14A001700
• a(n) = binomial(4*n+1, 2*n).at n=7A002458
• Least integer having Radon random number n.at n=28A002661
• Valence of graph of maximal intersecting families of sets.at n=28A007007
• Binomial coefficient C(29,n).at n=14A010945
• Binomial coefficient C(29,n).at n=15A010945
• a(n) = binomial coefficient C(n,14).at n=15A010967
• a(n) = binomial(n,15).at n=14A010968
• Expansion of 1/(1-4*x)^(17/2).at n=7A020928
• Number of reversible strings with n-1 black beads and n-1 white beads. String is not palindromic.at n=15A032095
• Number of 2n-bead black-white reversible strings with n black beads.at n=15A032123
• Central column of Losanitsch's triangle A034851.at n=30A034872
• a(n) = binomial(n, floor((n-1)/2)).at n=29A037952
• GCD of consecutive central binomial coefficients: a(n) = gcd(A001405(n+1), A001405(n)).at n=29A057977
• a(n) = 1/2*binomial(2*n,n) - (1+(-1)^n)/4*(binomial(n,floor(n/2)))^2.at n=15A058621
• Smallest number of crossing-free matchings on n points in the plane.at n=28A063549
• Largest term in the prime(n)-th row of Pascal's triangle, prime(n) being the n-th prime.at n=9A075890
• Total number of leaves in all rooted ordered trees with n edges.at n=15A088218
• Expansion of (1+x*c(x^2))^3/sqrt(1-4*x^2), c(x) the g.f. of A000108.at n=27A107232