1184040

Appears in sequences

• a(n) = binomial coefficient C(n,7).at n=21A000580
• a(n) = binomial coefficient C(2n, n-7).at n=7A004313
• a(n) = binomial(4n,n).at n=7A005810
• Binomial coefficient C(28,n).at n=7A010944
• Binomial coefficient C(28,n).at n=21A010944
• a(n) = binomial(n,21).at n=7A010974
• a(n) = binomial(n*(n+1)/2, n).at n=7A014068
• Number of compositions of n into 8 ordered relatively prime parts.at n=21A023033
• a(n) = binomial(n, floor(n/4)).at n=28A051036
• Binomial coefficients C(2*n-6,7).at n=10A053129
• Table by antidiagonals of number of ways of choosing k items from n*k.at n=48A060539
• Numbers k such that sopfr(k) = ud(k), where sopfr = A001414 and ud = A034444.at n=30A064029
• Binomial(n, smallest odd prime factor of n).at n=27A080212
• a(n) = binomial(n, greatest prime factor of n).at n=27A080213
• Triangle read by rows: T(n,k) = binomial(k*n,n), 1 <= k <= n.at n=24A096130
• Triangle, read by rows, where T(n,k) = C(n*(n-1)/2 - k*(k-1)/2 + n-k, n-k).at n=28A107862
• Triangle read by rows: T(n,k) = binomial(4n-k,n-k), 0 <= k <= n.at n=28A119304
• Triangle T(n,k) = binomial(3*n+1, 2*n+k+1), read by rows.at n=47A159841
• Triangle of Generalized Runyon numbers R_{n,k}^(3) read by rows.at n=42A173020
• Triangle T(n, k) = binomial(n*(n+1)/2 + k, k), read by rows.at n=35A176566