1486442880

Appears in sequences

• Unsigned Stirling numbers of first kind, s(n+1,2): a(n+1) = (n+1)*a(n) + n!.at n=12A000254
• a(n) = (Product k) * (Sum 1/k), where both the product and the sum are over those positive integers k, where k <= n and gcd(k,n) = 1.at n=12A056855
• Sum of all n-digit Stirling numbers of first kind.at n=9A131014
• The number of n-permutations having precisely two cycles whose lengths are relatively prime.at n=11A194364
• (n-1)-st elementary symmetric function of the first n terms of (2,1,4,3,6,5,8,7,...)=A103889.at n=11A203196
• Irregular triangular array read by rows. T(n,k) is the number of n-permutations with exactly k distinct cycle lengths; n>=1, 1<=k<=floor( (-1+(1+8n)^(1/2))/2 ).at n=33A224211
• Expansion of e.g.f. -log(1 - x)*arctanh(x).at n=13A302611