I am searching a way to solve a recursive definition for a sequence in the following form:
$a_n = c_{n-1}\cdot a_{n-1} + b_{n-1}$
So I'd like to have an explicit form of $a_n$ depending only on $c_i$ and $b_i$, but not on $a_n$. I know how to solve linear recursions, but the coefficients are not constant here. Or are there no well-known solutions for this case?