what i know :
if i want to find $Nth$ term of a fibonacci series like :
1 1 2 3 5 8 13 21 .......
then to find $6th$ term we use golden ratio like:

so it becomes like :
well and good.now
what i want to know :
what changes should i make in golden ratio or while applying it for different fibonacci series . For example :
1 6 7 13 20 33 .......
now if i want to find the 10th no. of above series then what changes should i do in golden ratio... now what is the value of X10's R.H.S(right hand side)
X10 = ? (for this fibonacci series)
In general, the solution of a recursion $a_n = A a_{n-1} + B a_{n-2}$ is of the form $a_n = C \lambda_1^n + D \lambda_2^n$, where $\lambda_{1,2}$ are the roots of $\lambda^2 - A \lambda - B = 0$. You can find $C$ and $D$ by plugging in $n=0$ and $n=1$.
For the Fibonacci sequence, one of $\lambda_{1,2}$ is equal to the golden ratio.