Fibonacci-type Sequences Explained with Worked Examples

In a Fibonacci-type sequence each term is the sum of the two before: .

Write 2x or 2*x to multiply, ^ for powers, and ; between simultaneous equations. You can also type factor, expand, derivative of, integrate … from a to b, limit … as x->0 or 15% of 80.

Try an example

Before you start

This page is easier if you are comfortable with:

What Fibonacci-type sequences means

The Fibonacci sequence starts 1, 1, 2, 3, 5, 8, 13, 21, … Other sequences with the same rule but different starting numbers are Fibonacci-type.

Questions often give two terms and ask you to work backwards or forwards, or find a missing term using algebra.

The ratio of consecutive terms gets close to the golden ratio, about 1.618. Each term follows a recurrence relation, the ratio of terms tends to a constant like a geometric sequence, and the nth-term idea is compared in the arithmetic sequence.

This page is part of Sequences in Algebra. Topics that work alongside it: Recurrence relation, Geometric sequence, Arithmetic sequence: nth term, x-intercept of a line, Equation of a straight line and Parallel lines have equal gradients.

What is it used for?

A Fibonacci-type sequence makes each term by adding the two before it. Different starting values give different sequences with the same rule.

How to use fibonacci-type sequences

  1. Write the rule: add the two previous terms.
  2. Work forwards by adding.
  3. To work backwards, subtract: .
  4. For an unknown term, form an equation.

Graph

A Fibonacci-type sequence 1, 3, 4, 7, 11, 18, 29012345678051015202530A Fibonacci-type sequence 1, 3, 4, 7, 11, 18, 29xyGraph with x from 0 to 8 and y from 0 to 32. Shows terms (7).

Each term is the sum of the two before it, so the sequence grows faster and faster.

Worked examples

These examples are worked by hand, step by step, so you can compare your own working.

Example 1: continue a sequence

A sequence starts 2, 5, … and each term is the sum of the previous two. Find the 6th term.

Worked example
Answer
3131
  1. Third term
  2. Fourth term
  3. Fifth term
  4. Sixth term

Example 2: a missing starting term

A Fibonacci-type sequence has , and . Find .

Worked example
Answer
a=5a=5
  1. Write u₃ and u₄
  2. Solve

Example 3: find a later term

A Fibonacci-type sequence starts 1, 3, … Find the 6th term.

Worked example
Answer
1818
  1. Add the previous two each time

Special cases

A few situations come up again and again. Knowing them saves time and helps you spot answers that cannot be right.

u₁ = 1, u₂ = 3

4, 7, 11, 18, 29, 47, 76, 123

u₁₀ = 123.

Sum of first 8

u₁₀ − u₂

120.

u₁ = 2, u₂ = 5

u₃ = 7, u₄ = 12, u₅ = 19

u₅ = 19.

Ratio uₙ₊₁/uₙ

123/76

1.6184.

Word problems

In a Fibonacci-type sequence uₙ₊₂ = uₙ₊₁ + uₙ. Σ_{k=1}^{n} u_k = u_{n+2} − u₂, and the ratio of consecutive terms tends to φ = 1.618.

Generate

u₁ = 1, u₂ = 3. Find u₅.

  1. u₃ = 4, u₄ = 7, u₅ = 11
  2. Check: ✓11

u₁₀

Continue to u₁₀.

  1. … 76, 123
  2. Check: ✓123

Sum Higher

Sum of the first 8 terms = u₁₀ − u₂.

  1. 123 − 3
  2. Check: ✓120

Ratio Higher

Find u₁₀/u₉ = 123/76.

  1. 1.618…
  2. Check: near φ ✓1.6184

Common mistakes

Adding the wrong terms

uₙ + uₙ₋₂ ✗

uₙ + uₙ₋₁ ✓

Consecutive.

Sum formula index

uₙ₊₁ − u₂ ✗

uₙ₊₂ − u₂ ✓

Two ahead.

Ratio exactly φ

exact ✗

tends to φ ✓

Limit.

Starting values

always 1, 1 ✗

any two starts ✓

Lucas: 2, 1.

Exam tips

  1. Add the previous two.
  2. Σuₖ = uₙ₊₂ − u₂.
  3. Ratio → φ.
  4. Any starting pair.
  5. Check with a list.

Practice questions

Try each one on paper, then open the answer. Use the solver above to see the full working.

1. u₆ from 1, 3: 4, 7, 11, 18 Foundation

29

2. u₅ from 2, 5 Foundation

19

3. Sum of first 6 terms of 1, 3, … (u₈ − u₂) Foundation

44

4. u₇ from 1, 1: 1,1,2,3,5,8,13 Higher

13

5. Ratio 13/8 to 4 d.p. Higher

1.625

6. Sum of first 5 Fibonacci numbers (u₇ − u₂) Higher

12

Practice generator

Unlimited fresh questions with instant marking. Choose a level, work it out on paper, then type your answer.

Solve: …

Key terms

Fibonacci-type sequence
uₙ₊₂ = uₙ₊₁ + uₙ.
Initial terms
u₁, u₂.
Golden ratio (φ)
1.618.
Lucas numbers
2, 1, 3, 4, 7.
Sum identity
Σ = uₙ₊₂ − u₂.
Recurrence
Rule.

Frequently asked questions

What is a Fibonacci-type sequence?

Each term is the sum of the previous two.

What is the sum of the first n terms?

uₙ₊₂ − u₂.

What does the ratio tend to?

The golden ratio.

Can I choose any start?

Yes.

Which page covers Binet’s formula?

Binet’s formula.

Which page covers periodic sequences?

periodic sequences.

More in Algebra and the formula sheets.