118124

Appears in sequences

• Unsigned Stirling numbers of first kind s(n,3).at n=6A000399
• Triangle read by rows of Stirling numbers of first kind, s(n,k), n >= 1, 1 <= k <= n.at n=38A008275
• Triangle of Stirling numbers of first kind, s(n, n-k+1), n >= 1, 1 <= k <= n. Also triangle T(n,k) giving coefficients in expansion of n!*binomial(x,n)/x in powers of x.at n=42A008276
• Triangle of Stirling numbers of first kind, s(n,k), n >= 0, 0 <= k <= n.at n=48A048994
• Exponential reciprocal of A055924.at n=38A055925
• Largest unsigned Stirling number of the first kind: max_k(s(n+1,k)); i.e., largest coefficient of polynomial x*(x+1)*(x+2)*(x+3)*...*(x+n).at n=8A065048
• Stirling numbers of the first kind.at n=8A081051
• 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=42A094638
• Seventh diagonal of triangle A008275 (Stirling1) and seventh column of |A008276|.at n=2A112002
• Alfred Moessner's factorial triangle.at n=30A125714
• 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=38A130534
• Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.at n=48A132393
• Maximal Stirling numbers of the first kind.at n=9A154416
• Triangle related to the asymptotic expansion of E(x,m=4,n).at n=21A163934
• Triangle related to the o.g.f.s. of the right hand columns of A163934 (E(x,m=4,n)).at n=21A163939
• Ordered Stirling numbers S1(n,k) >= 0.at n=41A193245
• Triangle read by rows: T(n,k) = (n-1-k)*abs(s(n,n+1-k)), where s(n,k) are the signed Stirling numbers of the first kind and 1 <= k <= n.at n=42A199220
• a(n) = |Stirling1(3*n,n)|.at n=3A237993
• Triangular array read by rows. T(n,k) is the number of even permutations of {1,2,...,n} that have exactly k cycles, n >= 0, 0 <= k <= n.at n=48A237996
• Number of orbits of size 2n in vertex graph of Lucas cube Lambda_n.at n=32A250115