Pigeonhole and Extremal Arguments · Hard problem

The greedy algorithm writes a fraction as a sum of distinct unit fractions: subtract the largest $\tfrac1d$ that fits, and repeat. The numerators of the remainders strictly decrease, so it stops. For $\dfrac{7}{15}$, what is the largest denominator used?