Define a sequence $(f_n)$ of rational functions by $f_1(x)=2,f_2(x)=x$ and
$$ f_{n}(x)=\frac{1}{f_{n-1}(x)}+\frac{1}{f_{n-2}(x)} $$
Let $I$ be the interval $I=[\frac{7}{6},\frac{3}{2}]$. Then
Fact. For $n\in [2,15]$, the minimum for $f_n$ on $I$ is attained on the boundary of $I$, i.e. at some $b_n\in \lbrace \frac{7}{6},\frac{3}{2} \rbrace$.
Can anyone prove or disprove my conjecture that this holds for any $n\geq 2$ ?
My thoughts : assuming the conjecture is true, denote the case where $b_n=\frac{7}{6}$ by $a$ and the case where $b_n=\frac{3}{2}$ by $b$, for $n=2$ to $n=30$, we have the following sequence :
$$abbabbaabaabaabbabbaabaabaabb$$
This sequence does not seem to follow any particular pattern.
Related : Proof of a limit for a recursively-defined sequence