Fibonacci sequence recurrence

Each Fibonacci number is the sum of the two before it, starting from 0 and 1, which generates the sequence 0, 1, 1, 2, 3, 5, 8. It is used to define the sequence and to compute its terms.

F_{n} = F_{n - 1} + F_{n - 2}, F_{0} = 0, F_{1} = 1

F_n = F_{n-1} + F_{n-2}, \quad F_0 = 0, \quad F_1 = 1

What the symbols mean

$F_{n}$	the n-th Fibonacci number
$n$	index of the term, a non-negative integer

About this formula

FieldMathematics
TopicSequences and series
LevelHigh school
Also calledFibonacci numbers formula, Fibonacci recurrence relation, Fibonacci sequence formula, Un(1,−1), Fibonacci series
SourceWikidata Q23835349

Write it in Obsidian

MathLive is a free visual math editor for Obsidian. Run Find a formula, type “fibonacci sequence recurrence”, and it goes into your note as editable LaTeX. You can also scan formulas from screenshots, PDFs and handwriting.

Get MathLive for Obsidian See how it works

What the symbols mean

About this formula

Write it in Obsidian

Related formulas