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 A051909 #35 Jun 19 2024 23:34:32 %S A051909 1,11,24,30,31,32,37,38,43,52,53,54,55,59,60,61,65,73,75,80,91 %N A051909 Subset of strict Egyptian numbers - there is a unique representation of 1 as the sum of distinct unit fractions with the sum of denominators being these numbers. %C A051909 Note the word "unique" in the definition, which makes this different from A052428. - _N. J. A. Sloane_, Jul 13 2017 %C A051909 From _Juhani Heino_, Jul 15 2017: (Start) %C A051909 McCranie conjectured that the sequence is finite. He was right. Numbers 92-269 all have at least two representations without 15 appearing among the reciprocals (list attached). In the same way that Graham did for strict Egyptian numbers, we can transform each representation (a_n) into an even (2, (2a_n)) and an odd (3, 9, 30, 45, (2a_n)). Because there are no 15's in the original representations, the odd transformation has distinct unit fractions. The same is trivially true for the even transformation because there are no 1's either. So if the original sum is s, the new sums are 2s+2 and 2s+87. 2*92+2 = 186, so the even sums can be obtained from transformations after that. 2*92+87 = 271, so the same holds for odd sums from that point. And as the pairs of original representations were distinct, so are the transformed pairs. %C A051909 If my programming and reasoning were correct, I proved that the sequence is full (no more members after 91), and my program in the raw mode (not ignoring the 15's) corroborates exactly with McCranie's results. Could somebody prove the uniqueness? %C A051909 (End) %H A051909 R. L. Graham, <a href="https://doi.org/10.1017/S1446788700039045">A theorem on partitions</a>, J. Austral. Math. Soc. 3:4 (1963), pp. 435-441. %H A051909 Juhani Heino, <a href="/A051909/a051909.txt">List of double representations from 92 to 269</a> %H A051909 <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a> %e A051909 1 = 1/2 + 1/3 + 1/6, 2 + 3 + 6 = 11, there is no other representation of 1 as the sum of distinct unit fractions whose numerators sum to 11, so 11 is in the sequence. %Y A051909 A subsequence of A052428. %Y A051909 Cf. A051882. %K A051909 full,nonn,fini %O A051909 1,2 %A A051909 _Jud McCranie_, Dec 16 1999 %E A051909 Name clarified by _Juhani Heino_, Jul 14 2017