3365856
domain: N
Appears in sequences
- a(n) = binomial coefficient C(n,7).at n=25A000580
- a(n) = binomial coefficient C(2n, n-9).at n=7A004315
- Binomial coefficient C(4n,n-1).at n=7A004331
- Binomial coefficient C(32,n).at n=7A010948
- Binomial coefficient C(32,n).at n=25A010948
- a(n) = binomial(n,25).at n=7A010978
- T(n,7), array T as in A050186; a count of aperiodic binary words.at n=25A051192
- Binomial coefficients C(2*n-6,7).at n=12A053129
- a(n) = binomial(n, A002024(n+1)-1) where A002024 is "n appears n times".at n=32A180272
- Number of nX8 binary arrays without the pattern 0 1 diagonally or vertically.at n=13A188842
- Triangle T read by rows: n-th row (n>=0) gives the non-vanishing coefficients of the polynomial q(n,x) = ((x+1)^(2^n) - (x-1)^(2^n))/2.at n=19A281122
- Triangle T read by rows: n-th row (n>=0) gives the non-vanishing coefficients of the polynomial q(n,x) = ((x+1)^(2^n) - (x-1)^(2^n))/2.at n=28A281122
- Number of ordered rooted binary trees with n leaves and with minimal Sackin tree balance index.at n=39A345135
- Number of subsets of [n] in which exactly half of the elements are Fibonacci numbers.at n=32A357927