Math sequence recursive formula

The sequence which is described to represent its first terms and the formula is to determine the other terms of the sequences such a formula is called as recursive formula .For example, 1, 4, 5, 9, 14, …, are the sequences because each term is obtained by taking the sum of preceding two terms .The corresponding recursive formula is a_{n + 2} = a_n + a_{n + 1} , n ≥ 1 here a₁ = 1, a₂ = 4,a₃ = 5. Terms of a sequences: The various numbers which occurs in the sequences are called its terms. We represents the terms of the sequences by a_1, a₂, a₃, … an the subscript denote the position of the term. The nth term is called the general term of the sequence.. The word ‘sequence’ is used as in the common use of the term to convey the idea of a set of things in order. For example, in the sequence 1, 3, 5, 7… 2n-1 the 1st term is 1, 2nd term is 3 and nth term is 2n − 1. Every number after the second is obtained by the sum of the previous two terms. V₁ = 1 V₂ = 1 V₃ = V₂ + V₁ V₄ = V₃ + V₂ V_n = V_{n − 1} + V_{n − 2} V_n = V_{n − 1} + V_{n − 2}.This sequence is called Fibonacci sequence.