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.
%I A238795 #23 Feb 16 2024 05:47:00
%S A238795 3,5,7,9,11,33,35,45,55,77,105
%N A238795 The unique set of eleven distinct positive odd numbers up to 105 the sum of whose reciprocals is 1.
%C A238795 For any set of distinct numbers whose reciprocals sum to 1, the largest must be neither a prime nor a prime power.
%C A238795 For sets of 11 distinct positive odd numbers, relaxing the a(11) <= 105 constraint allows a second solution at 115 (3, 5, 7, 9, 15, 21, 23, 45, 69, 105, 115), a third at 117 (3, 5, 7, 9, 13, 21, 35, 39, 63, 105, 117), 3 more at 135, 2 more at 143, and 2 more at 165. - _Jon E. Schoenfield_, Mar 07 2014
%H A238795 R. Arce-Nazario, F. Castro, and R. Figueroa, <a href="https://doi.org/10.1016/j.jnt.2012.11.011">On the number of solutions of Sum_{i = 1..11} 1/x_i = 1 in distinct odd natural numbers</a>, J. Number Theory, 133 (2013), pp. 2036-2046.
%H A238795 <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%e A238795 1/3 + 1/5 + 1/7 + 1/9 + 1/11 + 1/33 + 1/35 + 1/45 + 1/55 + 1/77 + 1/105 = 1.
%Y A238795 Cf. A201644, A239036.
%K A238795 nonn,fini,full
%O A238795 1,1
%A A238795 _Arkadiusz Wesolowski_, Mar 05 2014