I was recently fooling around on my calculator, and found a recurrence relation that behaves very weirdly (it started looking like a mutilated combination of sine graphs at some points, presumably due to some sort oscillation due to the subtraction):
$$a_n=1-\dfrac{a_{n-1}}{a_{n-2}}, \qquad a_1 = a, \qquad a_2 = b$$
Is there any explicit (non-recursive) formula for $a_n$ in this recurrence relation? Or is it just not possible to find it? If it's not possible to find it, are there any values of $a$ and $b$ that allow for a solution (similarly to the logistic map)?
Also, if at all possible, would it be possible to show work for this monstrosity?
If you ever get two successive values that are equal you get division by zero in two more steps. You can't alternate between two values, because to go $a,b,a,b,\ldots$ you need $$a=1-\frac ba\\b=1-\frac ab\\a^2=a-b\\b^2=b-a$$ and one of the squares must be negative. I ran $500$ iterations for a few starting values. Each time I got a pair of values in the hundreds when two preceding values were very close. It looks quite chaotic.
If you allow the values to be complex, you can alternate between $1+i$ and $1-i$ but that seems to be an unstable equilibrium.