Let D[n] be a sequence whose values are recursively related by D[n] = D[n-2] - D[n-1].

D[1] is fixed to be equal to 1. Most choices of D[2] will result in a sequence which eventually has some n such that D[n] is negative.

What is the set of values for D[2] exist such that all terms of D[n] are positive?