Search results
Create the page "Indexing of a sequence" on this wiki! See also the page found with your search.
- ...t and second terms are both equal to 1 and each subsequent term is the sum of the two preceding it. The first few terms are <math>1, 1, 2, 3, 5, 8, 13, ...th> for <math>n \geq 3</math>. This is the simplest nontrivial example of a [[linear recursion]] with constant coefficients. There is also an explicit7 KB (1,111 words) - 13:57, 24 June 2024