Fibonacci

Returns the desired Fibonacci number. Fibonacci numbers are the numbers in the Fibonacci sequence, characterized by the fact that every number after the first two is the sum of the two preceding ones: F(n)=F(n-1)+F(n-2). The first two numbers are defined as 1: F(1)=1;F(2)=1

If n is negative, the Fibonacci numbers are defined as F(n-2)=F(n)-F(n-1)

Syntax

fibonacci(Integer)

Description

Given an integer nLaTeXn, returns the nLaTeXn-th Fibonacci number: F(n).

arithmetic.fibonacci.calc.png