64224

Appears in sequences

• Associated Stirling numbers.at n=5A000276
• Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 2, 1 <= k <= floor(n/2)).at n=17A008306
• a(n) = Sum_{k=0..2n-1} T(n,k) * T(n,k+1), with T given by A027052.at n=6A027079
• Triangle T(n,k) read by rows; related to number of preorders.at n=34A079510
• Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 0 and 0 <= k <= floor(n/2)).at n=27A106828
• Numbers k such that k and k^2 use only the digits 1, 2, 4, 6 and 7.at n=35A136993
• Triangle T(n, k) = n! * (Harmonic number(n-k) - Harmonic number(k)), read by rows.at n=37A157525
• Number of (n+1) X (n+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to one, and every 2 X 2 determinant nonzero.at n=3A206002
• Number of (n+1) X 5 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to one, and every 2 X 2 determinant nonzero.at n=3A206006
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=24A206010
• Triangle read by rows, giving coefficients in an expansion of absolute values of Stirling numbers of the first kind in terms of binomial coefficients.at n=22A259456
• Triangle read by rows, T(n, k) = Sum_{m=0..k} (-1)^(m + k)*binomial(n + k, n + m) * |Stirling1(n + m, m)|, for n >= 0, 0 <= k <= n.at n=30A269940
• Regular triangle read by rows. T(n, k) = [[n, k]], where [[n, k]] are the second order Stirling cycle numbers (or second order reciprocal Stirling numbers). T(n, k) for 0 <= k <= n.at n=47A358622