|
Search: id:A097048
|
|
|
| A097048 |
|
a(n) = least denominator Y of the proper fractions X/Y which need n or more terms as an Egyptian fraction. |
|
+0
2
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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 ...
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, D11
|
|
LINKS
|
David Eppstein, Ten Algorithms for Egyptian Fractions
|
|
CROSSREFS
|
See A097049 for numerators.
Adjacent sequences: A097045 A097046 A097047 this_sequence A097049 A097050 A097051
Sequence in context: A060611 A103598 A077497 this_sequence A025067 A024371 A084758
|
|
KEYWORD
|
nonn,more,frac
|
|
AUTHOR
|
Ed Pegg Jr. (edp(AT)wolfram.com) and Don Reble (djr(AT)nk.ca) Jul 21 2004
|
|
|
Search completed in 0.002 seconds
|
