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 A201649 #9 Feb 04 2016 16:15:37 %S A201649 3,5,7,9,11,15,33,45,385 %N A201649 The fifth of the five known sets of nine distinct odd numbers the sum of whose reciprocals is 1. %C A201649 John Leech showed that nine is the smallest number of odd numbers with this property. %C A201649 This set was apparently discovered by S. Yamashita in 1976. %D A201649 R. K. Guy, Unsolved Problems in Number Theory (UPINT), Section D11. %H A201649 Nechemia Burshtein, <a href="http://dx.doi.org/10.1016/j.jnt.2007.01.007">The equation sum(i=1,9,1/xi)=1 in distinct odd integers has only the five known solutions</a>, Journal of Number Theory, Volume 127, Issue 1, November 2007, Pages 136-144. %H A201649 The Prime Puzzles and Problems Connection, <a href="http://www.primepuzzles.net/problems/prob_035.htm">Problem 35</a> %H A201649 <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a> %Y A201649 There are five known sets of nine odd numbers with this property: A201644, A201646, A201647, A201648, A201649. %K A201649 nonn,fini,full %O A201649 1,1 %A A201649 _N. J. A. Sloane_, Dec 03 2011