235592
domain: N
Appears in sequences
- Sum of increasing powers of divisors: a(n) = Sum_{i=1..q} d(i)^i where d(1) < d(2) < ... < d(q) are the divisors of n.at n=21A180851
- Triangular array read by rows: T(n,k) is the number of rooted labeled trees on n nodes that have exactly k nodes with outdegree = 1, n>=1, 0<=k<=n-1.at n=29A231602
- E.g.f. A(x) satisfies A'(x) = 1 + 2 * A(-log(1-x)).at n=7A355205