2035800
domain: N
Appears in sequences
- a(n) = binomial coefficient C(n,7).at n=23A000580
- a(n) = binomial coefficient C(2n, n - 8).at n=7A004314
- Binomial coefficient C(3n, n-3).at n=7A004321
- Binomial coefficient C(30,n).at n=7A010946
- Binomial coefficient C(30,n).at n=23A010946
- Binomial coefficient C(n,23).at n=7A010976
- Number of compositions of n into 8 ordered relatively prime parts.at n=23A023033
- a(n) = binomial(n, floor(n/4)).at n=30A051036
- T(n,7), array T as in A050186; a count of aperiodic binary words.at n=23A051192
- Binomial coefficients C(2*n-6,7).at n=11A053129
- Triangle, read by rows, where T(n,k) = C(n*(n-1)/2-k*(k-1)/2+n-k+2, n-k).at n=28A107870
- Column 0 of triangle A107870; a(n) = C( n*(n-1)/2 + n+2, n).at n=7A107871
- a(n) = binomial(n, A002024(n+1)-1) where A002024 is "n appears n times".at n=30A180272
- a(n) = binomial(4*n + 2,n).at n=7A257633
- Triangle T(n,k) = binomial(4*n - 3*k, 3*n - 2*k), 0 <= k <= n.at n=47A264773
- Binomial coefficients binomial(n,k) = uv such that n>=2k and u > v, where gpf(u) < k, gpf(v) >= k (gpf(n)= is the greatest prime factor of n).at n=6A286980
- Binomial coefficients binomial(n,k) = UV such that n>=2k and U > V, where gpf(U) <= k, gpf(V) > k (gpf(n)= is the greatest prime factor of n).at n=12A286981
- Minimal prime partition representation of even integers.at n=15A327414
- Number of ways to choose a multiset of n divisors of n - 1.at n=23A343936
- Number of subsets of [n] in which exactly half of the elements are Fibonacci numbers.at n=30A357927