In a recursive formula each succeeding term is formulated from the next term -- true or false?

False. The next term is unknown, so in a recursive formula, each term is formulated from one or more previous terms. For example, the Fibonacci sequence:


1,1,2,3,5,8,13,21,34,...


This can be represented by the recursive formula f(n)=f(n-2)+f(n-1). In this case, the two previous terms of the sequence are added together to formulate the term.In a recursive formula each succeeding term is formulated from the next term -- true or false?
Each term is formulated from the previous term. or terms


like the fibonnaci sequence


f[1]=1


f[2]=1


f[n]=f[n-2]+f[n-1]