OFFSET
1,1
REFERENCES
J. Steuding, Diophantine Analysis, Chapman & Hall/CRC, 2005, pp. 39-40, 50.
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..10000
D. Eppstein, Egyptian fractions
EXAMPLE
For n=3, the Greedy Algorithm gives 8/73=1/10+1/105+1/15330
MATHEMATICA
GreedyPart[q_Integer] := 0;
GreedyPart[Rational[1, y_]] := 0;
GreedyPart[q_Rational] := q - If[q < 0 || q > 1, Floor[q], Rational[1, 1 + Quotient[1, q]]];
SubtractShifted[l_] := Drop[l, -2] - Take[l, {2, -2}];
EgyptGreedy[q_] := SubtractShifted[FixedPointList[GreedyPart, q]];
terms := 200;
For[i = 25, i <= 24*terms + 1, i = i + 24, k = 2; While[Length[EgyptGreedy[4k/i]]> 3, k++ ]; Print[k]]
CROSSREFS
KEYWORD
nonn
AUTHOR
Matthew McMullen (mmcmullen(AT)otterbein.edu), Jan 09 2009
EXTENSIONS
More terms from Seiichi Manyama, Sep 21 2022
STATUS
approved