155117520

Appears in sequences

• Central binomial coefficients: binomial(2*n,n) = (2*n)!/(n!)^2.at n=15A000984
• a(n) = binomial(n, floor(n/2)).at n=30A001405
• Coefficients of Legendre polynomials.at n=14A002461
• Binomial coefficient C(30,n).at n=15A010946
• a(n) = binomial(n,15).at n=15A010968
• a(n) = Sum_{i=0..floor(n/2)} T(i,n-i), array T as in A047072.at n=31A047074
• Swinging factorial, a(n) = 2^(n-(n mod 2))*Product_{k=1..n} k^((-1)^(k+1)).at n=30A056040
• a(n) = n!/(k!)^2, where k is the largest number such that (k!)^2 divides n!.at n=29A056042
• Central binomial coefficient A001405(n) divided by its characteristic cube divisor A056201(n).at n=29A056202
• Numerator of binomial(2n,n)/(2n+1).at n=15A056616
• Number of n-step walks on a line starting from the origin but not returning to it.at n=30A063886
• a(n) = binomial(6*n,3*n).at n=5A066802
• Binomial(2k,k) when the first digit of binomial(2k,k) is 1.at n=4A068359
• Expansion of 2sinh(x) + BesselI_0(2x).at n=30A081668
• Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A069772.at n=30A089849
• Bisection of A000984.at n=7A099976
• a(n) = Sum_{k = 0..n} binomial(n,floor(k/2))*(-1)^(n-k).at n=30A126869
• Inverse binomial transform of A005043.at n=30A126930
• Central binomial coefficients C(2k,k) repeated.at n=30A128014
• Central binomial coefficients C(2k,k) repeated.at n=31A128014