21474180

Appears in sequences

• a(n) = binomial(n,11).at n=17A001288
• Binomial coefficients C(2n,n-3).at n=11A002696
• Binomial coefficient C(28,n).at n=11A010944
• Binomial coefficient C(28,n).at n=17A010944
• a(n) = binomial(n,17).at n=11A010970
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=22A024762
• a(n) = binomial(n, floor((n-5)/2)).at n=28A037953
• a(n) = binomial(n, floor((n-6)/2)).at n=28A037957
• T(2n+6,n), array T as in A050186; a count of aperiodic binary words.at n=11A051199
• a(n) = binomial(a,b) where a>=b and one of a and b is the product of the nonzero decimal digits of n and the other is the sum of the decimal digits of n.at n=47A067453
• a(n) = lcm{1, ..., 2n} / binomial(2n, n).at n=28A068550
• a(n) = max{ C(n,0), C(n-1,1), C(n-2,2), ..., C(n-n,n) }.at n=39A073028
• a(n) = binomial(floor(n*(sqrt(5)+3)/2), n) for n>=0.at n=11A135963
• Triangle T(n, k) = binomial((k+1)*(n-k+1), n+2) with T(0, 0) = 2, T(n, 0) = T(n, n) = 1, read by rows.at n=48A155869
• Triangle T(n, k) = binomial((k+1)*(n-k+1), n+2) with T(0, 0) = 2, T(n, 0) = T(n, n) = 1, read by rows.at n=51A155869
• a(n) = binomial(3*n-2,n+1).at n=8A261186
• a(n) = least number in row n of Pascal's triangle that exceeds every number in row n-1.at n=26A382851