For a sequence 
, the Levine-O'Sullivan greedy algorithm is given by
 |  |  |
(1)
|
 |  |  |
(2)
|
for 
.
The sequence generated by this algorithm is known, not terribly surprisingly, as
the Levine-O'Sullivan sequence.
Levine-O'Sullivan Greedy Algorithm
See also
A-Sequence, Greedy Algorithm, Levine-O'Sullivan SequenceExplore with Wolfram|Alpha
References
Finch, S. R. "Erdős' Reciprocal Sum Constants." §2.20 in Mathematical Constants. Cambridge, England: Cambridge University Press, pp. 163-166, 2003.Levine, E. and O'Sullivan, J. "An Upper Estimate for the Reciprocal Sum of a Sum-Free Sequence." Acta Arith. 34, 9-24, 1977.Referenced on Wolfram|Alpha
Levine-O'Sullivan Greedy AlgorithmCite this as:
Weisstein, Eric W. "Levine-O'Sullivan Greedy Algorithm." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Levine-OSullivanGreedyAlgorithm.html