Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030659
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030659 Smallest possible maximum denominator in an expression for 1 as a sum of n distinct unit (Egyptian) fractions. +0
1
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; listen)
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, K. S. Brown, On a Unit Fraction Question of Erdos and Graham

Index entries for sequences related to Egyptian fractions

CROSSREFS

Sequence in context: A118586 A113791 A135763 this_sequence A114304 A107487 A092671

Adjacent sequences: A030656 A030657 A030658 this_sequence A030660 A030661 A030662

KEYWORD

nonn,hard

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research