login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030659 Smallest possible maximum denominator in an expression for 1 as a sum of n distinct unit (Egyptian) fractions. 0
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 (list; graph; refs; listen; history; internal format)
OFFSET

3,1

REFERENCES

R. K. Guy (1981): Unsolved Problems In Number Theory, D11, also p. 161.

Computed by Dan Hoey (Hoey(AT)AIC.NRL.Navy.Mil)

LINKS

K. S. Brown, On a Unit Fraction Question of Erdos and Graham

Index entries for sequences related to Egyptian fractions

CROSSREFS

Sequence in context: A183029 A113791 A135763 * A142338 A114304 A175952

Adjacent sequences:  A030656 A030657 A030658 * A030660 A030661 A030662

KEYWORD

nonn,hard

AUTHOR

Dan Hoey (Hoey(AT)AIC.NRL.Navy.Mil)

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

Content is available under The OEIS End-User License Agreement .

Last modified February 13 03:38 EST 2012. Contains 205435 sequences.