9075135300

Appears in sequences

• Central binomial coefficients: binomial(2*n,n) = (2*n)!/(n!)^2.at n=18A000984
• a(n) = binomial(4n,2n) or (4*n)!/((2*n)!*(2*n)!).at n=9A001448
• Binomial coefficient C(36,n).at n=18A010952
• a(n) = binomial(n,18).at n=18A010971
• Expansion of 1/(1-4*x)^(19/2).at n=9A020930
• Numerator of binomial(2n,n)/(2n+1).at n=18A056616
• a(n) = binomial(6*n,3*n).at n=6A066802
• Smallest integer of the form product (n+1)(n+2)...(n+k)/n!.at n=18A075055
• Number of ways in which the points on an n X n square lattice can be equally occupied with spin "up" and spin "down" particles. If n is odd, we arbitrarily take the lattice to contain one more spin "up" particle than the number of spin "down" particles.at n=6A081623
• Expansion of 2sinh(x) + BesselI_0(2x).at n=36A081668
• a(n) = Sum_{k = 0..n} binomial(n,floor(k/2))*(-1)^(n-k).at n=36A126869
• Expansion of 1/sqrt(1-4*x) - x/sqrt(1-4*x^2).at n=18A129369
• Cyclic p-roots of prime lengths p(n).at n=7A136268
• Triangle binomial(6*n,6*m), 0 <= m <= n, read by rows.at n=24A177810
• Largest element of n-th row of Pascal's triangle that is not a multiple of n.at n=34A180733
• 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=37A182027
• A trisection of A001405 (central binomial coefficients): binomial(3*n,floor(3*n/2)), n >= 0.at n=12A187442
• 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=38A191529
• Triangle defined by T(n,k) = binomial(n^2, n*k), for n>=0, k=0..n, as read by rows.at n=24A209330
• Largest Euler characteristic of a downset on an n-dimensional cube.at n=36A214282