|
Search: id:A097049
|
|
|
| A097049 |
|
a(n) = least numerator X of the proper fractions X/A097048(n) which need n or more terms as an Egyptian fraction. |
|
+0
2
|
| |
|
|
OFFSET
|
1,2
|
|
|
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 A097048 for denominators.
Sequence in context: A051300 A001127 A051299 this_sequence A119490 A013174 A098204
Adjacent sequences: A097046 A097047 A097048 this_sequence A097050 A097051 A097052
|
|
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
|
