201376
domain: N
Appears in sequences
- Binomial coefficients C(n,5).at n=32A000389
- Binomial coefficient C(2n,n-11).at n=5A004317
- Binomial coefficient C(4n,n-3).at n=5A004333
- Binomial coefficient C(32,n).at n=5A010948
- Binomial coefficient C(32,n).at n=27A010948
- a(n) = binomial(n,27).at n=5A010980
- a(n) = binomial(2^n, n).at n=5A014070
- T(n,5), array T as in A050186; a count of aperiodic binary words.at n=27A050190
- a(n) = binomial(n, floor(n/6)).at n=32A051053
- Binomial coefficients C(2*n-4,5).at n=13A053127
- Number of subsets of {1,2,...,n} in which exactly half of the elements are less than or equal to sqrt(n).at n=32A102366
- Numbers n such that sigma(n) = 6*phi(n).at n=21A104900
- a(n) = binomial(n+2,2)*binomial(n+5,2).at n=27A105938
- Triangle, read by rows, where T(n,k) = C(n*(n-1)/2-k*(k-1)/2+n-k+2, n-k).at n=39A107870
- Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k - 1, n-k), for n>=k>=0.at n=30A122178
- a(n) = binomial(n, sum_digits_n).at n=32A128936
- Square table, read by antidiagonals, where T(n,k) = C((n+1)*2^(k-1), k) for n>=0, k>=0.at n=26A136462
- Triangle T, read by rows, where column 0 of T^m = {C(m*2^n, n), n>=0} for all m.at n=15A136470
- Triangle, read by rows, where T(n,k) = C(2^k,n-k) for n>=k>=0.at n=60A136501
- Square array, read by antidiagonals, where T(n,k) = binomial(2^k + n-1, k).at n=26A136555