

A030659


Smallest possible maximum denominator in an expression for 1 as a sum of n distinct unit (Egyptian) fractions.


4



6, 12, 15, 15, 18, 20, 24, 24, 28, 30, 33, 33, 35, 36, 40, 42, 48, 52, 52, 54, 55, 55, 56, 60, 63, 72, 75, 75, 76, 76, 77, 78, 80, 85, 85, 88, 90, 95, 96, 96, 100, 102, 104, 104, 108, 110, 114, 115, 115, 119, 119, 120, 126, 130, 132, 135, 138, 143, 144, 144
(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. 340342
R. K. Guy (1981): Unsolved Problems In Number Theory, D11, also p. 161.
Computed by Dan Hoey.


LINKS

Table of n, a(n) for n=3..62.
David Eppstein, Unit Fractions, smallest last term
Index entries for sequences related to Egyptian fractions


CROSSREFS

Cf. A213062.  Alois P. Heinz, Sep 21 2012
Sequence in context: A292289 A281352 A135763 * A142338 A114304 A175952
Adjacent sequences: A030656 A030657 A030658 * A030660 A030661 A030662


KEYWORD

nonn,hard


AUTHOR

Dan Hoey


EXTENSIONS

More terms from Jon E. Schoenfield, Mar 24 2014


STATUS

approved



