# Pre-Cal

Recursive Sequences:

find a formula for:
1,1,2,3,5,8,13,21

It looks like the Fibonacci sequence. Take the first two numbers and add them to get the 3rd. take the 2nd and third to get the fourth...etc.

yeah, but how would i write that into a formula?

1. 👍 0
2. 👎 0
3. 👁 42

## Similar Questions

1. ### math30

Sequences 1)A sequence has a first term of 24 and every other term is one half of the previous term. a)Write the first four terms of the sequence. b)Find a recursive formula that defines this sequence. c)Find an explicit formula

asked by alejandro on August 8, 2012
2. ### algebra

Could someone check my work; 1. Generate the first five terms in the sequence using the explicit formula. yn = –5n – 5 –30, –25, –20, –15, –10 30, 25, 20, 15, 10 –10, –15, –20, –25, –30(my answer) 10, 15,

asked by lee on February 3, 2013
3. ### Pre-Calc

Find three examples of the Fibonacci sequence in nature. Write a paragraph for each example. For each example, address the following questions: How does the example relate to the Fibonacci sequence? What portions of each item or

asked by Anonymous on September 11, 2011

For each of the following explicit descriptions of a sequence, find a recursive description; for the recursive ones, find an explicit rule. Assume sequences start from n = 1. 1. an = 2n2 − 3n 2. a1 = 4 and an+1 = an + 2 3. a1 =

asked by Sara V. on May 3, 2017
5. ### Algebra

Write a recursive formula for the following sequences: 1) 1,6,11,16... 2) 4, 12, 36, 108... 3) A ball is dropped from an initial height of 10 feet. The maximum heights the ball bounces are as shown (10 ft, 6 ft, 3.6 ft, 2.16 ft)

asked by INeedHelp on January 28, 2015
6. ### Sequences

Like the Fibonacci sequence, a certain sequence satisfies the recurrence relation an=an−1+an−2. Unlike the Fibonacci sequence, however, the first two terms are a1=4 and a2=1. Find a32.

asked by Daniel on February 9, 2018
7. ### Maths

A super-Fibonacci sequence is a list of whole numbers with the property that, from the third term onwards, every term is the sum of all the previous terms. For example, 1, 4, 5, 10, ... How many super-Fibonacci sequences with 1

asked by Palmer on November 16, 2016
8. ### Math (fibonacci

A sequence of numbers is called a Fibonacci-type sequence if each number (after for the first two) is the sum of the two numbers which precede it. For example, 1, 1, 2, 3, 5, 8 ... is a Fibonacci- type sequence. If 1985, x, y, 200

asked by Lexmo on August 8, 2014
9. ### 9th grade algebra (sequences)

Can you check my homework please? Given the following representations, tell whether it's arithmetic/geometric, find the difference/ratio, find the explicit formula, find the recursive formula, and the given term. (This whole

asked by Alexis on January 16, 2017
10. ### 9th grade algebra (recursive formula)

Can you explain how to find a sub 1 in the following problem? 1. Given 2 terms in an arithmetic sequence, find the recursive formula. a sub 18 = 3362 , a sub 38 = 7362 Steps: a. Find difference: (7632 - 3362)/(38 - 18) = 4000/20 =

asked by Alexis on January 10, 2017

More Similar Questions