While trying to solve an enumerative combinatorics problem, I reduced the problem to solving the following recurrence relation for $n\geq 2$:
for all $n\geq 2$, given that $x_2 = x_3=1$. I wanted to know if it is possible to find an explicit solution to this recurrence relation. If not, can we extract any useful information from the equation?
I've tried using the methods used for solving linear recurrence relations with constant coefficients, but they don't seem to work here. Any help/source to read up from will be appreciated.