9657700

Appears in sequences

• a(n) = binomial coefficient C(2n, n-1).at n=13A001791
• Valence of graph of maximal intersecting families of sets.at n=25A007007
• Binomial coefficient C(26,n).at n=12A010942
• Binomial coefficient C(26,n).at n=14A010942
• a(n) = binomial(n,12).at n=14A010965
• a(n) = binomial coefficient C(n,14).at n=12A010967
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=26A024761
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=15A024762
• a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n and s(0) = 3. Also a(n) = Sum{T(n,k), k = 0,1,...,[ (n+3)/2 ]}, where T is defined in A026022.at n=24A026023
• a(n) = binomial(n, floor((n-1)/2)).at n=26A037952
• a(n) = binomial(n, floor(n/2)-1).at n=26A037955
• Binomial(n, phi(n)), where phi(n) is the Euler totient function.at n=25A066449
• Expansion of (1+x)c(x^2)/((1-x^2*c(x^2))sqrt(1-4x^2)), c(x) the g.f. of A000108.at n=24A117187
• Expansion of (1+x)c(x^2)/((1-x^2*c(x^2))sqrt(1-4x^2)), c(x) the g.f. of A000108.at n=25A117187
• Triangle T(n, k, m) = round( Product_{j=0..m} binomial(2*(n+j), 2*(k+j))/binomial( 2*(n-k+j), 2*j) ), where m = 6, read by rows.at n=29A156739
• Triangle T(n, k, m) = round( Product_{j=0..m} binomial(2*(n+j), 2*(k+j))/binomial( 2*(n-k+j), 2*j) ), where m = 6, read by rows.at n=34A156739
• Expansion of (1 + 2*x)*(1 + sqrt(1+4*x))/(2*sqrt(1+4*x)).at n=14A158500
• Expansion of ( 2F1([-1/4, 1/4]; [-1/2], 16*x) - 1 ) / (2*x).at n=6A186231
• Largest Euler characteristic of a downset on an n-dimensional cube.at n=26A214282
• a(n) = (n!*m)/(m!*(m+1)!) where m = floor(n/2).at n=26A237884