22449

Appears in sequences

• Unsigned Stirling numbers of first kind s(n,5).at n=4A000482
• Stirling numbers of first kind s(n+4, n).at n=4A000915
• Triangle read by rows of Stirling numbers of first kind, s(n,k), n >= 1, 1 <= k <= n.at n=40A008275
• 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=40A008276
• Denominators of continued fraction convergents to sqrt(661).at n=8A042271
• Triangle of Stirling numbers of first kind, s(n,k), n >= 0, 0 <= k <= n.at n=50A048994
• a(n)=A069522(n)/n.at n=48A088392
• 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=40A094638
• Triangle, read by rows, where T(n,k) = A008275(k+1,n-k+1) are Stirling numbers of the first kind.at n=73A104416
• Alfred Moessner's factorial triangle.at n=32A125714
• Number of permutations of 2n-1 objects with exactly n cycles.at n=4A129505
• 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=40A130534
• Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.at n=50A132393
• Triangle T(n,k) read by rows: the coefficient [x^k] of the polynomial (n-1)! *sum_{i=0..n} Fibonacci(i)*binomial(x,n-i), read by rows, 0<=k<n.at n=50A139167
• Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows: T(n,k) is the number of forests of trees on n or fewer nodes using a subset of labels 1..n and k edges.at n=33A144258
• Triangle T(n, k) = A143491(n+2, k+2) + A143491(n+2, n-k+2), read by rows.at n=31A155755
• Triangle T(n, k) = A143491(n+2, k+2) + A143491(n+2, n-k+2), read by rows.at n=32A155755
• Triangle read by rows: T(n,m) = (-1)^n*Sum_{i=0..m} (-1)^(m-i)*binomial(n-i-1, m-i)*Stirling_1(n+i+1,i+1), for 0 <= m <= n.at n=14A156528
• Triangle read by rows: T(n,k) is number of non-derangement permutations of {1,2,...,n} having k cycles (1 <= k <= n).at n=40A162971
• Triangle read by rows. Polynomials based on sums of Moebius transforms.at n=40A177977