olemus
arvujada F[n], mis rahuldab rekurrentset seost:
i) F[0] = 0
ii) F[1] = 1
iii) F[n] = F[n-1] + F[n-2] kui n >1

näide
0, 1, 1, 2, 3, 5, 8, 13 jne

Oxford Languages:
a series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. The simplest is the series 1, 1, 2, 3, 5, 8, etc.

ülevaateid
https://www.mathsisfun.com/numbers/fibonacci-sequence.html

http://www.ijesi.org/papers/Vol(6)9/Version-3/B0609030714.pdf

https://en.wikipedia.org/wiki/Fibonacci_number

https://core.ac.uk/download/pdf/58824887.pdf

https://www.math.ust.hk/~machas/fibonacci.pdf

rakendusi
https://www.discov-her.com/the-fibonacci-sequence-the-important-applications-of-the-fibonacci-sequence/

https://www.quora.com/What-are-the-real-life-applications-of-Fibonacci-series

https://link.springer.com/content/pdf/bfm%3A978-94-009-1910-5%2F1.pdf

http://academy.kickex.com/tpost/shhlchx9gj-how-to-use-fibonacci-tools-in-the-crypto