Hassan H. answered 08/26/13
Math Tutor (All Levels)
Hello Brandi,
Since the Fibonacci sequence is recursively defined by
a0 = 1, a1 = 1; an+2 = an+1 + an for n ≥ 0,
we find that the sequence you are interested in, let's call it {bn}, satisfies
b1 = a1 - a0 = 0; bn+2 = an+2 - an+1 = an, for n ≥ 0,
by the definition of the Fibonacci sequence. Therefore, {bn} is another Fibonacci-type sequence itself, formed by the seeds (0,1), rather (1,1) as in the "usual" case.
Another way of putting this is that your sequence is a shift of the Fibonacci sequence, with 0 to occupy the first (newly created) slot.
Regards,
Hassan H.