Greedy Algorithm For Egyptian Fractions - Other Integer Sequences

Other Integer Sequences

The length, minimum denominator, and maximum denominator of the greedy expansion for all fractions with small numerators and denominators can be found in the On-Line Encyclopedia of Integer Sequences as sequences  A050205,  A050206, and  A050210, respectively. In addition, the greedy expansion of any irrational number leads to an infinite increasing sequence of integers, and the OEIS contains expansions of several well known constants. Some additional entries in the OEIS, though not labeled as being produced by the greedy algorithm, appear to be of the same type.

Read more about this topic:  Greedy Algorithm For Egyptian Fractions