10295472

Appears in sequences

• a(n) = binomial coefficient C(n,7).at n=30A000580
• Binomial coefficient C(37,n).at n=7A010953
• Binomial coefficient C(n,30).at n=7A010983
• a(n) = binomial(n, floor(n/5)).at n=37A051052
• T(n,7), array T as in A050186; a count of aperiodic binary words.at n=30A051192
• Binomial coefficients C(2*n+7,7).at n=15A053136
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=3A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=7A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=10A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=13A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=18A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=21A104181
• Let f(n)=mod(prime(n),12); then a(n) = binomial(prime(12),f(n)).at n=26A104181
• Triangle, read by rows, where T(n,k) = C(n*(n-1)/2-k*(k-1)/2+n-k+2, n-k).at n=37A107870
• Column 1 of triangle A107870; a(n) = C(n*(n+1)/2 + n+2, n).at n=7A107872
• Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k + 2, n-k), for n>=k>=0.at n=28A121336
• a(n) = binomial(prime(4+n), prime(4)).at n=8A126997
• Triangle T(n,k) = binomial(5*n - 4*k, 4*n - 3*k), 0 <= k <= n.at n=47A264774
• Number of ways to choose a multiset of n divisors of n.at n=29A343935
• Dirichlet g.f.: Product_{k>=2} 1 / (1 - k^(-s))^binomial(k+6,7).at n=30A344207