705432
domain: N
Appears in sequences
- Central binomial coefficients: binomial(2*n,n) = (2*n)!/(n!)^2.at n=11A000984
- a(n) = binomial(n,11).at n=11A001288
- a(n) = binomial(n, floor(n/2)).at n=22A001405
- From the enumeration of corners.at n=6A006334
- Expansion of (1-x^12) / (1-x)^12.at n=11A008494
- Triangle of coefficients of Legendre polynomials 2^n P_n (x).at n=36A008556
- Binomial coefficient C(22,n).at n=11A010938
- Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted.at n=29A024752
- Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted.at n=14A024753
- Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=5A024754
- Binomial coefficients: C(n,k), 7 <= k <= n-7, sorted, duplicates removed.at n=29A024759
- Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted, duplicates removed.at n=16A024760
- Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=8A024761
- Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=3A024762
- a(n) = Sum_{i=0..floor(n/2)} T(i,n-i), array T as in A047072.at n=23A047074
- Swinging factorial, a(n) = 2^(n-(n mod 2))*Product_{k=1..n} k^((-1)^(k+1)).at n=22A056040
- a(n) = n!/(k!)^2, where k is the largest number such that (k!)^2 divides n!.at n=21A056042
- Numerator of binomial(2n,n)/(2n+1).at n=11A056616
- Number of n-step walks on a line starting from the origin but not returning to it.at n=22A063886
- Smallest integer of the form product (n+1)(n+2)...(n+k)/n!.at n=11A075055