2704156

Appears in sequences

• Central binomial coefficients: binomial(2*n,n) = (2*n)!/(n!)^2.at n=12A000984
• a(n) = binomial(n, floor(n/2)).at n=24A001405
• a(n) = binomial(4n,2n) or (4*n)!/((2*n)!*(2*n)!).at n=6A001448
• a(1)=1; for n >= 1, a(n+1) = lcm(a(n),n) / gcd(a(n),n).at n=24A008339
• Expansion of (1-x^13) / (1-x)^13.at n=12A008495
• Binomial coefficient C(24,n).at n=12A010940
• a(n) = binomial(n,12).at n=12A010965
• Expansion of 1/(1-4*x)^(13/2).at n=6A020924
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=14A024754
• Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted, duplicates removed.at n=28A024760
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=16A024761
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=8A024762
• a(n) = Sum_{i=0..floor(n/2)} T(i,n-i), array T as in A047072.at n=25A047074
• Swinging factorial, a(n) = 2^(n-(n mod 2))*Product_{k=1..n} k^((-1)^(k+1)).at n=24A056040
• a(n) = n!/(k!)^2, where k is the largest number such that (k!)^2 divides n!.at n=23A056042
• Central binomial coefficient A001405(n) divided by its characteristic cube divisor A056201(n).at n=23A056202
• Numerator of binomial(2n,n)/(2n+1).at n=12A056616
• Number of n-step walks on a line starting from the origin but not returning to it.at n=24A063886
• a(n) = binomial(6*n,3*n).at n=4A066802
• Smallest integer of the form product (n+1)(n+2)...(n+k)/n!.at n=12A075055