1560780

Appears in sequences

• a(n) = binomial coefficient C(n,7).at n=22A000580
• Binomial coefficient C(29,n).at n=7A010945
• Binomial coefficient C(29,n).at n=22A010945
• a(n) = binomial(n,22).at n=7A010975
• a(n) = f(n,4) where f is given in A034261.at n=23A034264
• a(n) = binomial(n, floor(n/4)).at n=29A051036
• T(n,7), array T as in A050186; a count of aperiodic binary words.at n=22A051192
• Expansion of g.f.: (1+4*x)/(1-x)^7.at n=22A051946
• a(n) = (4n+1)*binomial(4n,n)/(3n+1).at n=7A052203
• Binomial coefficients C(2*n+7,7).at n=11A053136
• a(n) = (4*n-1)*4*n*(4*n+1).at n=29A069140
• Triangle, read by rows, where T(n,k) = C(n*(n-1)/2-k*(k-1)/2+n-k+1,n-k).at n=28A107867
• Column 0 of triangle A107867; a(n) = C( n*(n-1)/2 + n + 1, n).at n=7A107868
• G.f.: (1-16*x+28*x^2+56*x^3-140*x^4+56*x^5+28*x^6-16*x^7+x^8)/(x^2-x+1)^8.at n=22A112403
• a(n) = binomial(prime(4+n), prime(4)).at n=6A126997
• a(n) = binomial(n, A002024(n+1)-1) where A002024 is "n appears n times".at n=29A180272
• Triangle T(n,k) = binomial(4*n - 3*k, 3*n - 2*k), 0 <= k <= n.at n=37A264773
• Number of dispersed Dyck prefixes of length 2n and height n.at n=14A283799
• G.f. A(x) satisfies: A(x) = 1 + x + x^2 + x^3 + x^4 + x^5*A(x)^2.at n=41A307972
• Dirichlet g.f.: Product_{k>=2} 1 / (1 - k^(-s))^binomial(k+6,7).at n=22A344207