This site is supported by donations to The OEIS Foundation.



Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097048 a(n) = least denominator Y of the proper fractions X/Y which need n or more terms as an Egyptian fraction. 1
2, 3, 5, 11, 17, 79, 733, 27539 (list; graph; refs; listen; history; text; internal format)



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, ...

Checking just (p-1)/p for prime p finds no example requiring 9 parts for p <= 800399: see "results-single" in the github link. - Hugo van der Sanden, Feb 28 2015


R. K. Guy, Unsolved Problems in Number Theory, D11


Table of n, a(n) for n=1..8.

David Eppstein, Ten Algorithms for Egyptian Fractions

Hugo van der Sanden, code and results on github.


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


See A097049 for numerators.

Sequence in context: A077497 A237995 A178606 * A286268 A244914 A227126

Adjacent sequences:  A097045 A097046 A097047 * A097049 A097050 A097051




Ed Pegg Jr and Don Reble, Jul 21 2004


a(8) from Hugo van der Sanden, Sep 14 2010



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.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 18 05:08 EST 2017. Contains 294853 sequences.