219168
domain: N
Appears in sequences
- Triangle read by rows: T(n, k) = (k+1)*A132393(n+1, k+1), for 0 <= k <= n.at n=37A028421
- Number of ordered pairs of cycles over all n-permutations having two cycles.at n=9A052517
- Triangle read by rows, the ordered Stirling cycle numbers, T(n, k) = k!* s(n, k); n >= 0 k >= 0.at n=47A225479
- Number T(n,k) of permutations of [n] with k ordered cycles such that equal-sized cycles are ordered with increasing least elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=47A285849
- Number of permutations of [n] with two ordered cycles such that equal-sized cycles are ordered with increasing least elements.at n=7A285853
- Triangle read by rows, T(n, k) = Bell(k) * |Stirling1(n, k)|.at n=47A355260
- Triangle read by rows. The coefficients of the Hahn polynomials in ascending order of powers. T(n, k) = n! * [x^k] hypergeom([-x, -n, n + 1], [1, 1], 1).at n=37A358624
- Triangle read by rows: T(n, k) = (-1)^(n-k)*Stirling1(n, k)*CatalanNumber(k).at n=47A390723