63273

Appears in sequences

• Stirling numbers of first kind s(n+4, n).at n=5A000915
• Unsigned Stirling numbers of first kind s(n,6).at n=4A001233
• Triangle read by rows of Stirling numbers of first kind, s(n,k), n >= 1, 1 <= k <= n.at n=50A008275
• Stirling numbers of first kind S1(10,n).at n=5A011520
• Triangle of Stirling numbers of first kind, s(n,k), n >= 0, 0 <= k <= n.at n=61A048994
• 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=49A094638
• Number of permutations of length n which avoid the patterns 1234, 1324, 2431.at n=10A116841
• Alfred Moessner's factorial triangle.at n=41A125714
• 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=50A130534
• Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.at n=61A132393
• 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=50A162971
• Triangle read by rows. Polynomials based on sums of Moebius transforms.at n=49A177977
• Ordered Stirling numbers S1(n,k) >= 0.at n=35A193245
• 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=61A237996
• Triangle read by rows, Bell transform of the third-order Bell numbers, T(n,k) for n >= 0 and 0 <= k <= n.at n=61A264433
• Triangle read by rows. T(n, k) = |Stirling1(k + n, n)|.at n=25A354979
• Number of integer partitions of n whose parts do not have choosable sets of integer partitions.at n=44A387134