68923264410
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=19A001700
- Binomial coefficient C(39,n).at n=19A010955
- Binomial coefficient C(39,n).at n=20A010955
- a(n) = binomial(n,19).at n=20A010972
- a(n) = binomial(n,20).at n=19A010973
- Total number of leaves in all rooted ordered trees with n edges.at n=20A088218
- Bisection of A001700.at n=9A100033
- Denominators of values T(m,m) of urn game described in A108885 and A108886.at n=20A108884
- a(n) = binomial(2*n-1, n)*(-1)^n.at n=20A110556
- The number of Motzkin n-paths with exactly one flat step.at n=39A138364
- A trisection of A001405 (central binomial coefficients): binomial(3*n,floor(3*n/2)), n >= 0.at n=13A187442
- a(n) = binomial(4*n-1, 2*n).at n=10A259557
- Denominator of expected payoff in the "Guessing Card Colors" game with a 2n-card deck, using an optimal strategy.at n=19A322756