10400600

Appears in sequences

• Central binomial coefficients: binomial(2*n,n) = (2*n)!/(n!)^2.at n=13A000984
• a(n) = binomial(n, floor(n/2)).at n=26A001405
• Binomial coefficient C(26,n).at n=13A010942
• a(n) = binomial(n,13).at n=13A010966
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=16A024762
• a(n) = Sum_{i=0..floor(n/2)} T(i,n-i), array T as in A047072.at n=27A047074
• Swinging factorial, a(n) = 2^(n-(n mod 2))*Product_{k=1..n} k^((-1)^(k+1)).at n=26A056040
• a(n) = n!/(k!)^2, where k is the largest number such that (k!)^2 divides n!.at n=25A056042
• Numerator of binomial(2n,n)/(2n+1).at n=13A056616
• Number of n-step walks on a line starting from the origin but not returning to it.at n=26A063886
• Binomial(2k,k) when the first digit of binomial(2k,k) is 1.at n=3A068359
• Smallest integer of the form product (n+1)(n+2)...(n+k)/n!.at n=13A075055
• Binomial(n, smallest odd prime factor of n).at n=25A080212
• a(n) = binomial(n, greatest prime factor of n).at n=25A080213
• Expansion of 2sinh(x) + BesselI_0(2x).at n=26A081668
• Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A069772.at n=26A089849
• Bisection of A000984.at n=6A099976
• Denominators of values T(m,m) of urn game described in A108885 and A108886.at n=13A108884
• a(n) = Sum_{k = 0..n} binomial(n,floor(k/2))*(-1)^(n-k).at n=26A126869
• Inverse binomial transform of A005043.at n=26A126930