2681453775

Appears in sequences

• Number of permutations of 2n-1 objects with exactly n cycles.at n=7A129505
• 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=35A156528
• Eighth diagonal a(n) = s(n,n-7) of the unsigned Stirling numbers of the first kind with n>7.at n=7A191685
• Unsigned Stirling numbers of the first kind s(n,8).at n=7A243569
• Triangle read by rows. T(n, k) = |Stirling1(k + n, n)|.at n=43A354979