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 A097049 #15 Jul 29 2019 11:51:17 %S A097049 1,2,4,8,16,77,732,27538 %N A097049 a(n) = least numerator X of the proper fractions X/A097048(n) which need n or more terms as an Egyptian fraction. %C A097049 These are the simplest proper fractions requiring n parts as an Egyptian fraction, where "simplest" means smallest denominator and the smallest numerator breaks ties: 1/2, 2/3, 4/5, 8/11, 16/17, 77/79, 732/733, ... %D A097049 R. K. Guy, Unsolved Problems in Number Theory, D11 %H A097049 David Eppstein, <a href="http://library.wolfram.com/infocenter/Articles/2926/">Ten Algorithms for Egyptian Fractions</a> %H A097049 Hugo van der Sanden, <a href="https://github.com/hvds/seq/tree/master/least_eg">Code</a> %e A097049 27538/27539 is the simplest rational that cannot be expressed as the sum of 7 or fewer distinct unit fractions. That is, no rational p/q requires 8 or more with 0 < p/q < 1, and either q < 27539 or (q = 27539 and p < 27538). - _Hugo van der Sanden_, Sep 14 2010 %Y A097049 See A097048 for denominators. %K A097049 nonn,more,frac %O A097049 1,2 %A A097049 _Ed Pegg Jr_ and _Don Reble_, Jul 21 2004 %E A097049 a(8) from _Hugo van der Sanden_, Sep 14 2010