The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #13 Aug 06 2021 18:03:40
%S 2,3,14,33,35,88,115,273,296,403,609,943,1062,1073,1206,1519,2419,3283
%N The fourth of four solutions to a Monthly problem asking if there exist finite sequences 1 < a(1) < a(2) < ... < a(n) such that Sum_i 1/a(i) = 1 and gcd(a(i), a(i+1)) = 1 for 1 <= i < n.
%H Daniel Ullman, Proposer, <a href="https://www.jstor.org/stable/2323959">Problem E3359</a>, Amer. Math. Monthly, 98:2 (1991), 168.
%H <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%Y Cf. A346603, A346604, A346605.
%K nonn,fini,full
%O 1,1
%A _N. J. A. Sloane_, Aug 06 2021