Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Jan 27 2024 09:23:23
%S 1,1,1,24,293,9219,787444
%N a(n) = number of integer solutions to 1 <= x1 < x2 < ... < xn to 1/x1 + ... + 1/xn = (1 - 1/x1) * ... * (1 - 1/xn).
%C For any n, A369470(n) >= a(n) >= 1 (see A369607).
%H Max Muller et al., <a href="https://mathoverflow.net/q/462605">The diophantine equation \sum_{n=1}^{N} \frac{1}{x_{n}} = \prod_{k=1}^{N} \left(1-\frac{1}{x_{k}} \right)</a>, MathOverflow, 2024.
%Y Cf. A006585, A007850, A054377, A085098, A118086, A158649, A164014, A343074, A369470, A369607.
%K nonn,more
%O 1,4
%A _Max Alekseyev_, Jan 23 2024