2058000

Appears in sequences

• This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,4). The p-th row (p>=1) contains a(i,p) for i=1 to 4*p-3, where a(i,p) satisfies Sum_{i=1..n} C(i+3,4)^p = 5 * C(n+4,5) * Sum_{i=1..4*p-3} a(i,p) * C(n-1,i-1)/(i+4).at n=24A087108
• Triangle read by rows of products of (signless) Stirling numbers of the first kind (A132393) and Stirling numbers of the second kind (A008277).at n=41A187556
• a(n) = A003415(A324886(n)).at n=35A329047
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = -4.at n=27A380925
• Irregular triangular array read by rows: T(n,k) is the number of compatible pairs (f,g) of functions from [n] into [n] such that the integer partition induced by f and g is the k-th partition in the canonical (reverse lexicographic) ordering of the partitions, n>=0, 1<=k<=A000041(n).at n=37A390121