2333606220

Appears in sequences

• Central binomial coefficients: binomial(2*n,n) = (2*n)!/(n!)^2.at n=17A000984
• Binomial coefficient C(34,n).at n=17A010950
• a(n) = binomial(n,17).at n=17A010970
• Swinging factorial, a(n) = 2^(n-(n mod 2))*Product_{k=1..n} k^((-1)^(k+1)).at n=34A056040
• Number of n-step walks on a line starting from the origin but not returning to it.at n=34A063886
• Smallest integer of the form product (n+1)(n+2)...(n+k)/n!.at n=17A075055
• Binomial(n, smallest odd prime factor of n).at n=33A080212
• a(n) = binomial(n, greatest prime factor of n).at n=33A080213
• Expansion of 2sinh(x) + BesselI_0(2x).at n=34A081668
• Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A069772.at n=34A089849
• Bisection of A000984.at n=8A099976
• a(n) = Sum_{k = 0..n} binomial(n,floor(k/2))*(-1)^(n-k).at n=34A126869
• Largest element of n-th row of Pascal's triangle that is not a multiple of n.at n=32A180733
• a(n) = number of n-lettered words in the alphabet {1, 2} with as many occurrences of the substring (consecutive subword) [1, 1] as of [2, 2].at n=35A182027
• A trisection of A001405 (central binomial coefficients): binomial(3n+1,floor((3n+1)/2)), n >= 0.at n=11A187443
• Number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights) with no initial and no final (1,0)-steps.at n=36A191529
• a(n) = C(2*n,n) / gcd(n,C(2*n,n)).at n=17A195686
• The number s(j)=C(2j-2,j-1) such that n divides s(k)-s(j)>0, where k is the least positive integer for which such a j exists.at n=58A205013
• Expansion of (1 + sqrt( (1 + 2*x) / (1 - 2*x))) / 2 in powers of x.at n=35A210736
• a(n) = P_n(-1), where P_n(x) is a certain polynomial arising in the enumeration of tatami mat coverings.at n=34A226302