Actually my greedy algorithm was a defective one -- Given a real alpha, and a lower bound n, for the next denominator, it sets m = max(ceil(1/alpha),n), says that m is the next denominator, and then recursively calls the algorithm with alpha' = alpha - 1/m, and a lower bound of m+1. That's why I got a different sequence than A001466. Victor