# Category:Fibonacci numbers

From LiteratePrograms

The Fibonacci numbers are the integer sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, ..., in which each item is formed by adding the previous two. The sequence can be defined recursively by

Fibonacci number programs that implement this definition directly are often used as introductory examples of recursion. However, many other algorithms for calculating (or making use of) Fibonacci numbers also exist.

## Pages in category "Fibonacci numbers"

The following 22 pages are in this category, out of 22 total.

## B## C## D## E## F## H |
## I## J## L## O## P |
## P cont.## S## V |