1026576

Appears in sequences

• Unsigned Stirling numbers of first kind, s(n+1,2): a(n+1) = (n+1)*a(n) + n!.at n=9A000254
• Triangle read by rows of Stirling numbers of first kind, s(n,k), n >= 1, 1 <= k <= n.at n=46A008275
• Triangle read by rows of differences of reciprocals of unity.at n=37A008969
• Stirling numbers of first kind S1(10,n).at n=1A011520
• Triangle of Stirling numbers of first kind, s(n,k), n >= 0, 0 <= k <= n.at n=57A048994
• A triangle of generalized Stirling numbers: sum of consecutive terms in the harmonic sequence multiplied by the product of their denominators.at n=45A067176
• Triangle of coefficients, read by rows, where the n-th row forms the polynomial P(n,x) = {Sum_{k=1..n} 1/(k+x)}*{Product_{k=1..n} (k+x)}.at n=36A074246
• Signed Stirling numbers of the first kind.at n=9A081048
• Triangle read by rows: for 0 <= k < n, a(n, k) is the sum of the products of all subsets of {n-k, n-k+1, ..., n} with k members.at n=44A093905
• Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).at n=53A094638
• a(n) = (Sum 1/k) (Product k), where both the sum and product are over those k where 1 <= k <= n/2 and gcd(k,n) = 1.at n=17A099001
• Array read by descending antidiagonals: A(n, k) = (n + 1)! * H(k, n + 1), where H(n, k) is a higher-order harmonic number, H(0, k) = 1/k and H(n, k) = Sum_{j=1..k} H(n-1, j), for 0 <= k <= n.at n=53A105954
• Triangle read by rows: a(n, n) = n! and for 1 <= k < n, a(n, k) = Sum_{i=0..n-1} Product_{j=i+1..i+k} f(j, n), where for x <= y, f(x, y) = x and for x > y, f(x, y) = x-y.at n=43A109876
• Triangle from inverse scaled Pochhammer symbols.at n=53A112492
• Alfred Moessner's factorial triangle.at n=37A125714
• Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.at n=46A130534
• Sum of all n-digit Stirling numbers of first kind.at n=6A131014
• Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.at n=57A132393
• Maximal Stirling numbers of the first kind.at n=10A154416
• Triangle T(n, k) = n! * (Harmonic number(n-k) - Harmonic number(k)), read by rows.at n=45A157525