Fibonacci sequence, also known as golden section sequence, was introduced by mathematician Leonardo Fibonacci with rabbit breeding as an example, so it is also called "Rabbit Series". It refers to such a sequence: 1, 1, 2, 3, 5, 8, 13, 21, 34.In mathematics, Fibonacci sequence is defined by recursion as follows: F (1) = 1, f (2) = 1, f (n) = f (n - 1) + F (n - 2) (n ≥ 3, n ∈ n *)
Fibonacci sequence has direct application in modern physics, quasicrystal structure and chemistry
Fibonacci sequence was put forward by Italian Fibonacci in the 13th century, so it is called Fibonacci series.
General term formula
\([(1+√5)/2]^n/√5-[(1-√5)/2^n/√5\)
This calculator displays your Fibonacci sequence to the calculation quantity you specified. It is accurate to 32 bits (78 iterations)
Enter value: 5
The entered value cannot exceed 5 digits (including 5 digits). If the number exceeds 5 digits, your computer will run very slowly.
Click "Calculate" to output the result
0 1 1 2 3
Powered by TorCMS (https://github.com/bukun/TorCMS).