Levine-O'Sullivan Greedy Algorithm

For a sequence $\{\chi_i\}$, the Levine-O'Sullivan greedy algorithm is given by

$$\chi_1 = 1$$

$$\chi_i = \max\limits_{1\leq j\leq i-1} (j+1)(i-\chi_j)$$

for $i>1$.

See also Greedy Algorithm, Levine-O'Sullivan Sequence

References

Levine, E. and O'Sullivan, J. ``An Upper Estimate for the Reciprocal Sum of a Sum-Free Sequence.'' Acta Arith. 34, 9-24, 1977.