175689
domain: N
Appears in sequences
- Consider the non-unitary aliquot parts, in ascending order, of a composite number. Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to themselves.at n=13A307859
- Number of unlabeled semi-binary rooted trees with n nodes in which the non-leaf branches directly under any given node are all equal.at n=25A320271
- E.g.f. A(x) satisfies: A'(x) = 1 + A(x)*A'(x)^4.at n=5A376174