A374583 a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_n such that 0 < x_1 < ... < x_n and x_k | x_n for all k = 1..n.

1, 0, 1, 5, 44, 975, 59234, 15474226

Offset: 1

Author

Max Alekseyev, Jul 12 2024

Keywords

• nonn
• more
• hard

Comments

Also, number of integers m such that m is the sum of n distinct divisors of m including 1.

x_n <= A000058(n-1)-1.

Crossrefs

Cf. A002967, A280518, A374582.