17672631900
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=18A001700
- a(n) = binomial(4*n+1, 2*n).at n=9A002458
- Coefficients of Legendre polynomials.at n=18A002461
- Binomial coefficient C(37,n).at n=18A010953
- Binomial coefficient C(37,n).at n=19A010953
- a(n) = binomial(n,18).at n=19A010971
- a(n) = binomial(n,19).at n=18A010972
- Expansion of 1/(1-4*x)^(21/2).at n=9A020932
- Number of reversible strings with n-1 black beads and n-1 white beads. String is not palindromic.at n=19A032095
- Number of 2n-bead black-white reversible strings with n black beads.at n=19A032123
- Central column of Losanitsch's triangle A034851.at n=38A034872
- a(n) = 1/2*binomial(2*n,n) - (1+(-1)^n)/4*(binomial(n,floor(n/2)))^2.at n=19A058621
- Largest term in the prime(n)-th row of Pascal's triangle, prime(n) being the n-th prime.at n=11A075890
- Total number of leaves in all rooted ordered trees with n edges.at n=19A088218
- a(n) = Sum_{k=0..n} C(n,k)^2*mod(k,2).at n=19A110145
- Number of n-element subsets of [2n] having an even sum.at n=19A119358
- The number of Motzkin n-paths with exactly one flat step.at n=37A138364
- Trisection of A000984 (central binomial coefficients): binomial(2(3n+1),3n+1)/2, n>=0.at n=6A187364
- A trisection of A001405 (central binomial coefficients): binomial(3n+1,floor((3n+1)/2)), n >= 0.at n=12A187443
- A trisection of A001405 (central binomial coefficients): binomial(3n+2,floor((3n+2)/2))/2, n >= 0.at n=12A187444