Fibonacci numbers
Each term equals the sum of the two previous terms in 0, 1, 1, 2, 3, 5…
Formula or test
F(n) = F(n-1) + F(n-2)
Examples
0 · 1 · 1 · 2 · 144
Members
45 numbers
- 0View number
- 1View number
- 1View number
- 2View number
- 3View number
- 5View number
- 8View number
- 13View number
- 21View number
- 34View number
- 55View number
- 89View number
- 144View number
- 233View number
- 377View number
- 610View number
- 987View number
- 1597View number
- 2584View number
- 4181View number
- 6765View number
- 10946View number
- 17711View number
- 28657View number
- 46368View number
- 75025View number
- 121393View number
- 196418View number
- 317811View number
- 514229View number
- 832040View number
- 1346269View number
- 2178309View number
- 3524578View number
- 5702887View number
- 9227465View number
- 14930352View number
- 24157817View number
- 39088169View number
- 63245986View number
- 102334155View number
- 165580141View number
- 267914296View number
- 433494437View number
- 701408733View number
FAQ
- Why does 1 appear twice?
- The common sequence starts 0, 1, 1, 2, so 1 appears at indexes 1 and 2.