2983680

Appears in sequences

• Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,14)-perfect numbers.at n=2A019291
• Inverse BINOMIAL transform of A335691.at n=7A335692
• Triangle read by rows: T(n,k) = number of circuits of length k in the complete undirected graph on n labeled vertices, for n >= 1 and k = 0 .. n(n-1)/2.at n=54A357887
• Expansion of e.g.f. log((1-x)^4 / (x^4 - 5*x^3 + 6*x^2 - 4*x + 1)).at n=8A385903
• Expansion of e.g.f. exp(x^3/(1-x)^4).at n=8A387264