This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A073546 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. 6
 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, 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, 8, 9, 10, 15, 18, 20, 21, 24, 28, 6, 7, 8, 9, 10, 14, 15, 18, 20, 24, 28, 30 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 REFERENCES 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 R. K. Guy, Unsolved Problems in Number Theory, 2nd Edition, page 161. LINKS K. S. Brown, Unit Fractions, smallest last term EXAMPLE n=3: 2,3,6; n=4: 2,4,6,12; n=5: 2,4,10,12,15; n=6: 3,4,6,10,12,15; ... CROSSREFS Sequence in context: A224910 A275734 A216993 * A216975 A275666 A319432 Adjacent sequences:  A073543 A073544 A073545 * A073547 A073548 A073549 KEYWORD nonn,tabf AUTHOR Robert G. Wilson v, Aug 27 2002 EXTENSIONS Edited by Max Alekseyev, Mar 01 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 17 20:55 EST 2018. Contains 317278 sequences. (Running on oeis4.)