86493225

Appears in sequences

• a(n) = binomial(5*n,2*n).at n=6A001450
• Binomial coefficients C(2n,n-3).at n=12A002696
• Binomial coefficient C(30,n).at n=12A010946
• Binomial coefficient C(30,n).at n=18A010946
• a(n) = binomial(n,12).at n=18A010965
• a(n) = binomial(n,18).at n=12A010971
• a(n) = binomial(n, floor((n-5)/2)).at n=30A037953
• a(n) = binomial(n, floor((n-6)/2)).at n=30A037957
• Triangle read by rows: T(n,m) = number of m-block proper covers (without empty blocks and without multiple blocks) of a labeled n-set (n>=2, 2<=m<=2^n-2).at n=35A095421
• Triangle read by rows: T(n,m) = number of m-block proper T_0-covers (without empty blocks and without multiple blocks) of a labeled n-set (n>=2, 2<=m<=2^n-2).at n=35A095422
• 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 = 8, read by rows.at n=29A156741
• 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 = 8, read by rows.at n=34A156741
• Triangle binomial(6*n,6*m), 0 <= m <= n, read by rows.at n=17A177810
• Triangle binomial(6*n,6*m), 0 <= m <= n, read by rows.at n=18A177810
• a(n) = least number in row n of Pascal's triangle that exceeds every number in row n-1.at n=28A382851