The rule for the sequence is an = xn-1 + xn-2The sequence of numbers, 1, 1, 2, 3, 5, 8, 13, . . . , in which each successive number is equal to the sum of the two preceding numbers.
1 2 3 4 5 2 5 8 11 14 ... If this is the sequence, the position-to-term rule is 3n-1. However, it could be another sequence depending on the rest of the terms.
Those are the first four prime numbers.
3 4 6 9 13 18...1....2....3....4......5
It is not possible to give a conclusive answer because for a recursive relationship of order 1, the first (or 0th) term must be specified.A(n) = (5*n^2 + 3*n + 2*A(1) - 8)/2 for n = 1, 2, 3, ...
Start with 3 and multiply by 5 and 3 alternately in sequence.
Each term is the sum of the 2 preceding terms; where the first 2 terms are 1 and 1. So 1, 1, 2, 3, 5, 8, 13, 21 etc.
-7
3^n+5. Next is 734
The rule for the sequence is an = xn-1 + xn-2The sequence of numbers, 1, 1, 2, 3, 5, 8, 13, . . . , in which each successive number is equal to the sum of the two preceding numbers.
1 2 3 4 5 2 5 8 11 14 ... If this is the sequence, the position-to-term rule is 3n-1. However, it could be another sequence depending on the rest of the terms.
Those are the first four prime numbers.
The explicit formula here is 5+ 6x. solved at x=25 you get 155
3 4 6 9 13 18...1....2....3....4......5
-7
It is not possible to give a conclusive answer because for a recursive relationship of order 1, the first (or 0th) term must be specified.A(n) = (5*n^2 + 3*n + 2*A(1) - 8)/2 for n = 1, 2, 3, ...
6n-5 is the nth term of this sequence