%I #9 Mar 01 2018 12:48:30
%S 2,3,6,2,4,6,12,2,4,10,12,15,3,4,6,10,12,15,3,4,9,10,12,15,18,3,5,9,
%T 10,12,15,18,20,4,5,8,9,10,15,18,20,24,5,6,8,9,10,12,15,18,20,24,5,6,
%U 8,9,10,15,18,20,21,24,28,6,7,8,9,10,14,15,18,20,24,28,30
%N Triangle read by rows: row n gives denominators of n distinct unit fractions (or Egyptian fractions) summing to 1, where denominators are listed in increasing order and the largest denominator is smallest possible.
%D Mohammad K. Azarian, Sylvester's Sequence and the Infinite Egyptian Fraction Decomposition of 1, Problem 958, College Mathematics Journal, Vol. 42, No. 4, September 2011, p. 330. Solution published in Vol. 43, No. 4, September 2012, pp. 340-342
%D R. K. Guy, Unsolved Problems in Number Theory, 2nd Edition, page 161.
%H K. S. Brown, <a href="http://www.ics.uci.edu/~eppstein/numth/egypt/kterm-minden.html">Unit Fractions, smallest last term</a>
%e n=3: 2,3,6;
%e n=4: 2,4,6,12;
%e n=5: 2,4,10,12,15;
%e n=6: 3,4,6,10,12,15;
%e ...
%K nonn,tabf
%O 3,1
%A _Robert G. Wilson v_, Aug 27 2002
%E Edited by _Max Alekseyev_, Mar 01 2018