749398

Appears in sequences

• Binomial coefficients C(n,5).at n=41A000389
• Number of dissections of a polygon: binomial(6n,n)/(5n+1).at n=7A002295
• Binomial coefficients C(2*n+5,5).at n=18A002299
• Binomial coefficient C(41,n).at n=5A010957
• Binomial coefficient C(n,36).at n=5A010989
• a(n) = floor(binomial(n,6)/6).at n=41A011852
• a(n) = (n+1)*(n+2)*(n+3)*(9n+4)/24.at n=36A051798
• a(n) = binomial(n,floor(n/7)).at n=41A062947
• a(n) = lcm(n, n+1, n+2, n+3, n+4) / 60.at n=36A067048
• Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k, n-k), for n>=k>=0.at n=39A121334
• a(n) = binomial(prime(3+n), prime(3)).at n=10A126996
• a(n) = binomial(n*(n+1),n)/(n+1).at n=6A135861
• Generalized or s-Catalan numbers.at n=33A137211
• a(n) = binomial(prime(n),s)/prime(n) where s is the sum of the decimal digits of prime(n).at n=9A176267
• Triangle T(n, k) = binomial(n*(n+1)/2 + k, k), read by rows.at n=50A176566
• Number of n-member subsets of [7*n] whose elements sum to a multiple of seven.at n=6A318595
• Number of 6-member subsets of [6*n] whose elements sum to a multiple of n.at n=7A318627
• Dirichlet g.f.: Product_{k>=2} 1 / (1 - k^(-s))^binomial(k+4,5).at n=36A344205
• Number of subsets of {1..n-1} whose cardinality is one less than the length of the binary expansion of n; a(0) = 0.at n=42A370819
• a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/5)} a(5*k) * a(n-1-5*k).at n=35A386379