601080390

Appears in sequences

• Central binomial coefficients: binomial(2*n,n) = (2*n)!/(n!)^2.at n=16A000984
• a(n) = binomial(n, floor(n/2)).at n=32A001405
• a(n) = binomial(4n,2n) or (4*n)!/((2*n)!*(2*n)!).at n=8A001448
• Binomial coefficient C(32,n).at n=16A010948
• a(n) = binomial(n,16).at n=16A010969
• Expansion of 1/(1-4*x)^(17/2).at n=8A020928
• a(n) = Sum_{i=0..2^(n-1)} binomial(2^(n-1), i)^2.at n=5A037293
• a(n) = Sum_{i=0..floor(n/2)} T(i,n-i), array T as in A047072.at n=33A047074
• Swinging factorial, a(n) = 2^(n-(n mod 2))*Product_{k=1..n} k^((-1)^(k+1)).at n=32A056040
• a(n) = n!/(k!)^2, where k is the largest number such that (k!)^2 divides n!.at n=31A056042
• Central binomial coefficient A001405(n) divided by its characteristic cube divisor A056201(n).at n=31A056202
• Number of n-step walks on a line starting from the origin but not returning to it.at n=32A063886
• Binomial(n, phi(n)), where phi(n) is the Euler totient function.at n=31A066449
• a(1) = 1. a(n) = n*a(n-1) if gcd(n,a(n-1)) = 1, a(n-1)/n if n divides a(n-1), otherwise a(n) = a(n-1).at n=31A068629
• a(1) = 1. a(n) = n*a(n-1) if gcd(n,a(n-1)) = 1, a(n-1)/n if n divides a(n-1), otherwise a(n) = a(n-1).at n=30A068629
• a(n) = (2n)!/(phi(2n)!)^2.at n=15A072116
• Smallest integer of the form product (n+1)(n+2)...(n+k)/n!.at n=16A075055
• Expansion of 2sinh(x) + BesselI_0(2x).at n=32A081668
• Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A069772.at n=32A089849
• Weight enumerator of [32,31,2] Reed-Muller code RM(4,5).at n=8A110847