4537567650
domain: N
Appears in sequences
- 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=17A001700
- Least integer having Radon random number n.at n=34A002661
- Binomial coefficient C(35,n).at n=17A010951
- Binomial coefficient C(35,n).at n=18A010951
- a(n) = binomial(n,17).at n=18A010970
- a(n) = binomial(n,18).at n=17A010971
- a(n) = binomial(n, floor((n-1)/2)).at n=35A037952
- GCD of consecutive central binomial coefficients: a(n) = gcd(A001405(n+1), A001405(n)).at n=35A057977
- Smallest number of crossing-free matchings on n points in the plane.at n=34A063549
- Total number of leaves in all rooted ordered trees with n edges.at n=18A088218
- Bisection of A001700.at n=8A100033
- a(n) = binomial(2*n-1, n)*(-1)^n.at n=18A110556
- The number of Motzkin n-paths with exactly one flat step.at n=35A138364
- Expansion of (1 + sqrt( (1 + 2*x) / (1 - 2*x))) / 2 in powers of x.at n=36A210736
- Largest Euler characteristic of a downset on an n-dimensional cube.at n=35A214282
- a(n) = binomial(4*n-1, 2*n).at n=9A259557
- Denominator of expected payoff in the "Guessing Card Colors" game with a 2n-card deck, using an optimal strategy.at n=17A322756
- a(n) = floor(binomial(n-1, floor((n-1)/2))/2).at n=34A366108