13109088

Appears in sequences

• Number of factorizations of permutations of n letters into ordered cycles.at n=9A007840
• Matrix product of unsigned Stirling1-triangle |A008275(n,k)| and unsigned Lah-triangle |A008297(n,k)|.at n=36A079640
• Triangle read by rows, T(n, k) = (-1)^(n-k)*n!*[t^k]([x^n] exp(x*t)/(1 + log(1+x))) for 0<=k<=n.at n=45A291978
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. 1/(1 + k*log(1 - x)).at n=64A320079
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. 1/(1 + x^k/k! * log(1 - x)).at n=54A355652
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. 1/(1 + x^k * log(1 - x)).at n=54A355665
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (k*j)!* |Stirling1(n,k*j)|.at n=64A357881