cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A369470 a(n) = number of integer solutions to 1 <= x1 <= x2 <= ... <= xn to 1/x1 + ... + 1/xn = (1 - 1/x1) * ... * (1 - 1/xn).

This page as a plain text file.
%I A369470 #13 Jan 27 2024 09:28:46
%S A369470 1,1,2,35,455,13624,1176579
%N A369470 a(n) = number of integer solutions to 1 <= x1 <= x2 <= ... <= xn to 1/x1 + ... + 1/xn = (1 - 1/x1) * ... * (1 - 1/xn).
%C A369470 For any n, a(n) >= A369469(n) >= 1 (see A369607).
%H A369470 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 A369470 Cf. A002966, A007850, A054377, A085098, A118086, A158649, A164014, A342267, A348625, A369469, A369607.
%K A369470 nonn,more
%O A369470 1,3
%A A369470 _Max Alekseyev_, Jan 23 2024