In mathematics, the Fibonacci numbers are the numbers in the following integer sequence:
 (sequence A000045 in OEIS).
By definition, the first two Fibonacci numbers are 0 and 1, and each subsequent number is the sum of the previous two.
In mathematical terms, the sequence F_{n} of Fibonacci numbers is defined by the recurrence relation

with seed values

The Fibonacci sequence is named after Leonardo of Pisa, who was known as Fibonacci. Fibonacci's 1202 book Liber Abaci introduced the sequence to Western European mathematics, although the sequence had been described earlier in Indian mathematics. (By modern convention, the sequence begins with F_{0} = 0. The Liber Abaci began the sequence with F_{1} = 1, omitting the initial 0, and the sequence is still written this way by some.)
Fibonacci numbers are closely related to Lucas numbers in that they are a complementary pair of Lucas sequences. They are intimately connected with the Golden ratio, for example the closest rational approximations to the ratio are 2/1, 3/2, 5/3, 8/5, ... . Applications include computer algorithms such as the Fibonacci search technique and the Fibonacci heap data structure, and graphs called Fibonacci cubes used for interconnecting parallel and distributed systems. They also appear in biological settings,^{[5]} such as branching in trees, arrangement of leaves on a stem, the fruit spouts of a pineapple, the flowering of artichoke, an uncurling fern and the arrangement of a pine cone
Origins
The Fibonacci sequence appears in Indian mathematics, in connection with Sanskrit prosody, In the Sanskrit oral tradition, there was much emphasis on how long (L) syllables mix with the short (S), and counting the different patterns of L and S within a given fixed length results in the Fibonacci numbers; the number of patterns that are m short syllables long is the Fibonacci number F_{m + 1}.
Susantha Goonatilake writes that the development of the Fibonacci sequence "is attributed in part to Pingala (200 BC), later being associated with Virahanka (c. 700 AD), Gopāla (c.1135 AD), and Hemachandra (c.1150)". Parmanand Singh cites Pingala's cryptic formula misrau cha ("the two are mixed") and cites scholars who interpret it in context as saying that the cases for m beats (F_{m}) is obtained by adding a [S] to F_{m1} cases and [L] to the F_{m2} cases. He dates Pingala before 450 BCE.
However, the clearest exposition of the series arises in the work of Virahanka (c. 700AD), whose own work is lost, but is available in a quotation by Gopala (c.1135):
 Variations of two earlier meters [is the variation]... For example, for [a meter of length] four, variations of meters of two [and] three being mixed, five happens. [works out examples 8, 13, 21]... In this way, the process should be followed in all mAtrAvr.ttas (prosodic combinations).
The series is also discussed by Gopala (before 1135AD) and by the Jain scholar Hemachandra (c. 1150AD).
In the West, the Fibonacci sequence first appears in the book Liber Abaci (1202) by Leonardo of Pisa, known as Fibonacci.^{[1]} Fibonacci considers the growth of an idealized (biologically unrealistic) rabbit population, assuming that: a newlyborn pair of rabbits, one male, one female, are put in a field; rabbits are able to mate at the age of one month so that at the end of its second month a female can produce another pair of rabbits; rabbits never die and a mating pair always produces one new pair (one male, one female) every month from the second month on. The puzzle that Fibonacci posed was: how many pairs will there be in one year?
 At the end of the first month, they mate, but there is still only 1 pair.
 At the end of the second month the female produces a new pair, so now there are 2 pairs of rabbits in the field.
 At the end of the third month, the original female produces a second pair, making 3 pairs in all in the field.
 At the end of the fourth month, the original female has produced yet another new pair, the female born two months ago produces her first pair also, making 5 pairs.
At the end of the nth month, the number of pairs of rabbits is equal to the number of new pairs (which is the number of pairs in month n − 2) plus the number of pairs alive last month (n − 1). This is the nth Fibonacci number.
The name "Fibonacci sequence" was first used by the 19th century number theorist Edouard Lucas.
List of Fibonacci numbers
The first 21 Fibonacci numbers F_{n} for n = 0, 1, 2, ... , 20 are:

F_{0} 
F_{1} 
F_{2} 
F_{3} 
F_{4} 
F_{5} 
F_{6} 
F_{7} 
F_{8} 
F_{9} 
F_{10} 
F_{11} 
F_{12} 
F_{13} 
F_{14} 
F_{15} 
F_{16} 
F_{17} 
F_{18} 
F_{19} 
F_{20} 
0 
1 
1 
2 
3 
5 
8 
13 
21 
34 
55 
89 
144 
233 
377 
610 
987 
1597 
2584 
4181 
6765 
The sequence can also be extended to negative index n using the rearranged recurrence relation

which yields the sequence of "negafibonacci" numbers satisfying

Thus the complete sequence is

F_{−8} 
F_{−7} 
F_{−6} 
F_{−5} 
F_{−4} 
F_{−3} 
F_{−2} 
F_{−1} 
F_{0} 
F_{1} 
F_{2} 
F_{3} 
F_{4} 
F_{5} 
F_{6} 
F_{7} 
F_{8} 
−21 
13 
−8 
5 
−3 
2 
−1 
1 
0 
1 
1 
2 
3 
5 
8 
13 
21 
Occurrences in mathematics
The Fibonacci numbers are the sums of the "shallow" diagonals (shown in red) of Pascal's triangle.
The Fibonacci numbers occur in the sums of "shallow" diagonals in Pascal's triangle and Lozanić's triangle (see Binomial coefficient). They occur more obviously in Hosoya's triangle.
The Fibonacci numbers can be found in different ways in the sequence of binary strings.
 The number of binary strings of length n without consecutive 1s is the Fibonacci number F_{n+2}. For example, out of the 16 binary strings of length 4, there are F_{6} = 8 without consecutive 1s – they are 0000, 1000, 0100, 0010, 1010, 0001, 1001 and 0101. By symmetry, the number of strings of length n without consecutive 0s is also F_{n+2}.
 The number of binary strings of length n without an odd number of consecutive 1s is the Fibonacci number F_{n+1}. For example, out of the 16 binary strings of length 4, there are F_{5} = 5 without an odd number of consecutive 1s – they are 0000, 0011, 0110, 1100, 1111.
 The number of binary strings of length n without an even number of consecutive 0s or 1s is 2F_{n}. For example, out of the 16 binary strings of length 4, there are 2F_{4} = 6 without an even number of consecutive 0s or 1s – they are 0001, 1000, 1110, 0111, 0101, 1010.
Relation to the golden ratio
Closedform expression
Like every sequence defined by linear recurrence, the Fibonacci numbers have a closedform solution. It has become very well known as Binet's formula, even though it was already known by Abraham de Moivre:

where

is the golden ratio (sequence A001622 in OEIS), and
 ^{[15]}
To see this, note that φ and ψ are both solutions of the equation

so the powers of φ and ψ satisfy the Fibonacci recursion. In other words

and

It follows that for any values a and b, the sequence defined by

satisfies the same recurrence

If a and b are chosen so that U_{0} = 0 and U_{1} = 1 then the resulting sequence U_{n} must be the Fibonacci sequence. This is the same as requiring a and b satisfy the system of equations:


which has solution

producing the required formula.
Computation by rounding
Since for all , the number F(n) is the closest integer to Therefore it can be found by rounding, or in terms of the floor function:

Similarly, if we already know that the number F is a Fibonacci number, we can determine its index within the sequence by

Limit of consecutive quotients
Johannes Kepler observed that the ratio of consecutive Fibonacci numbers converges. He wrote that "as 5 is to 8 so is 8 to 13, practically, and as 8 is to 13, so is 13 to 21 almost", and concluded that the limit approaches the golden ratio .

This convergence does not depend on the starting values chosen, excluding 0, 0. For example, the initial values 19 and 31 generate the sequence 19, 31, 50, 81, 131, 212, 343, 555 ... etc. The ratio of consecutive terms in this sequence shows the same convergence towards the golden ratio.
In general, we have:

Decomposition of powers of the golden ratio
Since the golden ratio satisfies the equation

this expression can be used to decompose higher powers as a linear function of lower powers, which in turn can be decomposed all the way down to a linear combination of and 1. The resulting recurrence relationships yield Fibonacci numbers as the linear coefficients:

This expression is also true for if the Fibonacci sequence is extended to negative integers using the Fibonacci rule
Matrix form
A 2dimensional system of linear difference equations that describes the Fibonacci sequence is

or

The eigenvalues of the matrix A are and , and the elements of the eigenvectors of A, and , are in the ratios and Using these facts, and the properties of eigenvalues, we can derive a direct formula for the nth element in the fibonacci series:

The matrix has a determinant of −1, and thus it is a 2×2 unimodular matrix. This property can be understood in terms of the continued fraction representation for the golden ratio:

The Fibonacci numbers occur as the ratio of successive convergents of the continued fraction for , and the matrix formed from successive convergents of any continued fraction has a determinant of +1 or −1.
The matrix representation gives the following closed expression for the Fibonacci numbers:

Taking the determinant of both sides of this equation yields Cassini's identity

Additionally, since A^{n}A^{m} = A^{m + n} for any square matrix A, the following identities can be derived:


In particular, with m = n,


For another way to derive the F_{2n + k} formulas see the "EWD note" by Dijkstra.
Recognizing Fibonacci numbers
The question may arise whether a positive integer z is a Fibonacci number. Since F(n) is the closest integer to , the most straightforward, bruteforce test is the identity

which is true if and only if z is a Fibonacci number. In this formula, F(n) can be computed rapidly using any of the previously discussed closedform expressions.
One implication of the above expression is this: if it is known that a number z is a Fibonacci number, we may determine an n such that F(n) = z by the following:

Alternatively, a positive integer z is a Fibonacci number if and only if one of 5z^{2} + 4 or 5z^{2} − 4 is a perfect square.
A slightly more sophisticated test uses the fact that the convergents of the continued fraction representation of are ratios of successive Fibonacci numbers. That is, the inequality

(with coprime positive integers p, q) is true if and only if p and q are successive Fibonacci numbers. From this one derives the criterion that z is a Fibonacci number if and only if the closed interval

contains a positive integer. For , it is easy to show that this interval contains at most one integer, and in the event that z is a Fibonacci number, the contained integer is equal to the next successive Fibonacci number after z. Somewhat remarkably, this result still holds for the case z = 1, but it must be stated carefully since 1 appears twice in the Fibonacci sequence, and thus has two distinct successors.
Identities
The Young–Fibonacci graph, showing a combinatorial interpretation of the Fibonacci numbers.
For more details on this topic, see Young–Fibonacci lattice.
Most identities involving Fibonacci numbers draw from combinatorial arguments. F(n) can be interpreted as the number of sequences of 1s and 2s that sum to n − 1, with the convention that F(0) = 0, meaning no sum will add up to −1, and that F(1) = 1, meaning the empty sum will "add up" to 0. Here the order of the summands matters. For example, 1 + 2 and 2 + 1 are considered two different sums and are counted twice. This is discussed in further detail at Young–Fibonacci lattice.
First identity

 For n > 1.
 The nth Fibonacci number is the sum of the previous two Fibonacci numbers.
Proof 
We must establish that the sequence of numbers defined by the combinatorial interpretation above satisfy the same recurrence relation as the Fibonacci numbers (and so are indeed identical to the Fibonacci numbers).
The set of F(n + 1) ways of making ordered sums of 1s and 2s that sum to n may be divided into two nonoverlapping sets. The first set contains those sums whose first summand is 1; the remainder sums to n − 1, so there are F(n) sums in the first set. The second set contains those sums whose first summand is 2; the remainder sums to n − 2, so there are F(n − 1) sums in the second set. The first summand can only be 1 or 2, so these two sets exhaust the original set. Thus F(n + 1) = F(n) + F(n − 1).

Second identity

 The sum of the first n Fibonacci numbers is the (n + 2)nd Fibonacci number minus 1.
Proof 
We count the number of ways summing 1s and 2s to n + 1 such that at least one of the summands is 2.
As before, there are F(n + 2) ways summing 1s and 2s to n + 1 when n ≥ 0. Since there is only one sum of n + 1 that does not use any 2, namely 1 + ... + 1 (n + 1 terms), we subtract 1 from F(n + 2).
Equivalently, we can consider the first occurrence of 2 as a summand. If, in a sum, the first summand is 2, then there are F(n) ways to the complete the counting for n − 1. If the second summand is 2 but the first is 1, then there are F(n − 1) ways to complete the counting for n − 2. Proceed in this fashion. Eventually we consider the (n + 1)th summand. If it is 2 but all of the previous n summands are 1s, then there are F(0) ways to complete the counting for 0. If a sum contains 2 as a summand, the first occurrence of such summand must take place in between the first and (n + 1)th position. Thus F(n) + F(n − 1) + ... + F(0) gives the desired counting.
By induction:
 For n = 0, , so the equation is true for n = 0.
 For n = x, assume .
 Add the next Fibonacci number F_{x + 1} to both sides: .
 By the Fibonacci recurrence relation, F_{x + 1} + F_{x + 2} = F_{x + 3}, so , which is the n = x + 1 case, proving that where the equation is true for n = x, so is it for n = x + 1.

Third identity
This identity has slightly different forms for F_{j}, depending on whether j is odd or even.
The sum of the first n − 1 Fibonacci numbers, F_{j}, such that j is odd, is the (2n)th Fibonacci number.

The sum of the first n Fibonacci numbers, F_{j}, such that j is even, is the (2n + 1)th Fibonacci number minus 1.

Proofs 
1: j is odd
By induction for F_{2n}:



A basis case for this could be F_{1} = F_{2}.
2: j is even
By induction for F_{2n+1}:



A basis case for this could be F_{0} = F_{1} − 1.

Alternative proof 
By using identity 1 we can construct a telescoping sum:

If the summands are the Fibonacci numbers with even index, the proof is very similar. Summing both cases yields identity 2.

Fourth identity

Proof 
This identity can be established in two stages. First, we count the number of ways summing 1s and 2s to −1, 0, ..., or n + 1 such that at least one of the summands is 2.
By our second identity, there are F(n + 2) − 1 ways summing to n + 1; F(n + 1) − 1 ways summing to n; ...; and, eventually, F(2) − 1 way summing to 1. As F(1) − 1 = F(0) = 0, we can add up all n + 1 sums and apply the second identity again to obtain
 [F(n + 2) − 1] + [F(n + 1) − 1] + ... + [F(2) − 1]
 = [F(n + 2) − 1] + [F(n + 1) − 1] + ... + [F(2) − 1] + [F(1) − 1] + F(0)
 = F(n + 2) + [F(n + 1) + ... + F(1) + F(0)] − (n + 2)
 = F(n + 2) + [F(n + 3) − 1] − (n + 2)
 = F(n + 2) + F(n + 3) − (n + 3).
On the other hand, we observe from the second identity that there are
 F(0) + F(1) + ... + F(n − 1) + F(n) ways summing to n + 1;
 F(0) + F(1) + ... + F(n − 1) ways summing to n;
......
Adding up all n + 1 sums, we see that there are
 (n + 1) F(0) + n F(1) + ... + F(n) ways summing to −1, 0, ..., or n + 1.
Since the two methods of counting refer to the same number, we have
 (n + 1) F(0) + n F(1) + ... + F(n) = F(n + 2) + F(n + 3) − (n + 3)
Finally, we complete the proof by subtracting the above identity from n + 1 times the second identity.

Fifth identity

 The sum of the squares of the first n Fibonacci numbers is the product of the nth and (n + 1)th Fibonacci numbers.
Proof 
Although this identity can be established by either induction or direct, albeit messy, algebraic manipulation, perhaps the most elegant and most insightful method is by a simple geometric argument.
Consider the Fibonacci Rectangles constructed in previous sections. Using a common trick, we will compute the area of this rectangle in two different ways. But since this must yield the same answer in both cases, we know these resulting expressions must be equal, which will yield the desired identity.
On the one hand, the nth rectangle is composed of n squares, whose side lengths are F(1), F(2), ... , F(n). Its area is therefore the sum of each of these squares, which is given by
 .
On the other hand, we know that the nth rectangle has side lengths F(n) and F(n+1). Thus, its area is simply given by
 F_{n}F_{n + 1}.
Setting these expressions equal to each other completes the proof.

Identity for doubling n

Another identity
Another identity useful for calculating F_{n} for large values of n is

from which other identities for specific values of k, n, and c can be derived below, including

for all integers n and k. Dijkstra points out that doubling identities of this type can be used to calculate F_{n} using O(log n) long multiplication operations of size n bits. The number of bits of precision needed to perform each multiplication doubles at each step, so the performance is limited by the final multiplication; if the fast SchönhageStrassen multiplication algorithm is used, this is O(n log n log log n) bit operations. Notice that, with the definition of Fibonacci numbers with negative n given in the introduction, this formula reduces to the double n formula when k = 0.
Other identities
Other identities include relationships to the Lucas numbers, which have the same recursive properties but start with L_{0} = 2 and L_{1} = 1. These properties include F_{2n} = F_{n}L_{n}.
There are also scaling identities, which take you from F_{n} and F_{n+1} to a variety of things of the form F_{an+b}; for instance
 by Cassini's identity.



These can be found experimentally using lattice reduction, and are useful in setting up the special number field sieve to factorize a Fibonacci number. Such relations exist in a very general sense for numbers defined by recurrence relations. See the section on multiplication formulae under Perrin numbers for details.
Power series
The generating function of the Fibonacci sequence is the power series

This series has a simple and interesting closedform solution for :^{[23]}

This solution can be proven by using the Fibonacci recurrence to expand each coefficient in the infinite sum defining s(x):

Solving the equation s(x) = x + xs(x) + x^{2}s(x) for s(x) results in the closed form solution.
In particular, math puzzlebooks note the curious value ,^{[24]} or more generally

for all integers .
Conversely,

Reciprocal sums
Infinite sums over reciprocal Fibonacci numbers can sometimes be evaluated in terms of theta functions. For example, we can write the sum of every oddindexed reciprocal Fibonacci number as

and the sum of squared reciprocal Fibonacci numbers as

If we add 1 to each Fibonacci number in the first sum, there is also the closed form

and there is a nice nested sum of squared Fibonacci numbers giving the reciprocal of the golden ratio,

Results such as these make it plausible that a closed formula for the plain sum of reciprocal Fibonacci numbers could be found, but none is yet known. Despite that, the reciprocal Fibonacci constant

has been proved irrational by Richard AndréJeannin.
Millin series gives a remarkable identity:

which follows from the closed form for its partial sums as N tends to infinity:

Primes and divisibility
Divisibility properties
Every 3rd number of the sequence is even and more generally, every kth number of the sequence is a multiple of F_{k}. Thus the Fibonacci sequence is an example of a divisibility sequence. In fact, the Fibonacci sequence satisfies the stronger divisibility property

Fibonacci primes
Main article: Fibonacci prime
A Fibonacci prime is a Fibonacci number that is prime (sequence A005478 in OEIS). The first few are:
 2, 3, 5, 13, 89, 233, 1597, 28657, 514229, ...
Fibonacci primes with thousands of digits have been found, but it is not known whether there are infinitely many.
F_{kn} is divisible by F_{n}, so, apart from F_{4} = 3, any Fibonacci prime must have a prime index. As there are arbitrarily long runs of composite numbers, there are therefore also arbitrarily long runs of composite Fibonacci numbers.
With the exceptions of 1, 8 and 144 (F_{1} = F_{2}, F_{6} and F_{12}) every Fibonacci number has a prime factor that is not a factor of any smaller Fibonacci number (Carmichael's theorem).
144 is the only nontrivial square Fibonacci number. Attila Pethő proved in 2001 that there are only finitely many perfect power Fibonacci numbers. In 2006, Y. Bugeaud, M. Mignotte, and S. Siksek proved that only 8 and 144 are nontrivial perfect powers.
No Fibonacci number greater than F_{6} = 8 is one greater or one less than a prime number.
Any three consecutive Fibonacci numbers, taken two at a time, are relatively prime: that is,
 gcd(F_{n}, F_{n+1}) = gcd(F_{n}, F_{n+2}) = 1.
More generally,
 gcd(F_{n}, F_{m}) = F_{gcd(n, m).}
Prime divisors of Fibonacci numbers
The divisibility of Fibonacci numbers by a prime p is related to the Legendre symbol which is evaluated as follows:

If p is a prime number then
For example,

It is not known whether there exists a prime p such that . Such primes (if there are any) would be called Wall–Sun–Sun primes.
Also, if p ≠ 5 is an odd prime number then:

Examples of all the cases:
















For odd n, all odd prime divisors of F_{n} are ≡ 1 (mod 4), implying that all odd divisors of F_{n} (as the products of odd prime divisors) are ≡ 1 (mod 4).
For example, F_{1} = 1, F_{3} = 2, F_{5} = 5, F_{7} = 13, F_{9} = 34 = 2×17, F_{11} = 89, F_{13} = 233, F_{15} = 610 = 2×5×61
Periodicity modulo n
Main article: Pisano period
It may be seen that if the members of the Fibonacci sequence are taken mod n, the resulting sequence must be periodic with period at most n^{2}. The lengths of the periods for various n form the socalled Pisano periods (sequence A001175 in OEIS). Determining the Pisano periods in general is an open problem, although for any particular n it can be solved as an instance of cycle detection.
Right triangles
Starting with 5, every second Fibonacci number is the length of the hypotenuse of a right triangle with integer sides, or in other words, the largest number in a Pythagorean triple. The length of the longer leg of this triangle is equal to the sum of the three sides of the preceding triangle in this series of triangles, and the shorter leg is equal to the difference between the preceding bypassed Fibonacci number and the shorter leg of the preceding triangle.
The first triangle in this series has sides of length 5, 4, and 3. Skipping 8, the next triangle has sides of length 13, 12 (5 + 4 + 3), and 5 (8 − 3). Skipping 21, the next triangle has sides of length 34, 30 (13 + 12 + 5), and 16 (21 − 5). This series continues indefinitely. The triangle sides a, b, c can be calculated directly:



These formulas satisfy for all n, but they only represent triangle sides when n > 2.
Any four consecutive Fibonacci numbers F_{n}, F_{n+1}, F_{n+2} and F_{n+3} can also be used to generate a Pythagorean triple in a different way:

Example 1: let the Fibonacci numbers be 1, 2, 3 and 5. Then:




Magnitude
Since F_{n} is asymptotic to , the number of digits in is asymptotic to . As a consequence, for every integer d > 1 there are either 4 or 5 Fibonacci numbers with d decimal digits.
More generally, in the base b representation, the number of digits in F_{n} is asymptotic to .
Applications
The Fibonacci numbers are important in the computational runtime analysis of Euclid's algorithm to determine the greatest common divisor of two integers: the worst case input for this algorithm is a pair of consecutive Fibonacci numbers.
Yuri Matiyasevich was able to show that the Fibonacci numbers can be defined by a Diophantine equation, which led to his original solution of Hilbert's tenth problem.
The Fibonacci numbers are also an example of a complete sequence. This means that every positive integer can be written as a sum of Fibonacci numbers, where any one number is used once at most. Specifically, every positive integer can be written in a unique way as the sum of one or more distinct Fibonacci numbers in such a way that the sum does not include any two consecutive Fibonacci numbers. This is known as Zeckendorf's theorem, and a sum of Fibonacci numbers that satisfies these conditions is called a Zeckendorf representation. The Zeckendorf representation of a number can be used to derive its Fibonacci coding.
Fibonacci numbers are used by some pseudorandom number generators.
Fibonacci numbers are used in a polyphase version of the merge sort algorithm in which an unsorted list is divided into two lists whose lengths correspond to sequential Fibonacci numbers  by dividing the list so that the two parts have lengths in the approximate proportion φ. A tapedrive implementation of the polyphase merge sort was described in The Art of Computer Programming.
Fibonacci numbers arise in the analysis of the Fibonacci heap data structure.
The Fibonacci cube is an undirected graph with a Fibonacci number of nodes that has been proposed as a network topology for parallel computing.
A onedimensional optimization method, called the Fibonacci search technique, uses Fibonacci numbers.
The Fibonacci number series is used for optional lossy compression in the IFF 8SVX audio file format used on Amiga computers. The number series compands the original audio wave similar to logarithmic methods such as µlaw.
In music, Fibonacci numbers are sometimes used to determine tunings, and, as in visual art, to determine the length or size of content or formal elements. It is commonly thought that the third movement of Béla Bartók's Music for Strings, Percussion, and Celesta was structured using Fibonacci numbers.
Since the conversion factor 1.609344 for miles to kilometers is close to the golden ratio (denoted φ), the decomposition of distance in miles into a sum of Fibonacci numbers becomes nearly the kilometer sum when the Fibonacci numbers are replaced by their successors. This method amounts to a radix 2 number register in golden ratio base φ being shifted. To convert from kilometers to miles, shift the register down the Fibonacci sequence instead.
In nature
Yellow Chamomile head showing the arrangement in 21 (blue) and 13 (aqua) spirals. Such arrangements involving consecutive Fibonacci numbers appear in a wide variety of plants.
Fibonacci sequences appear in biological settings,^{[5]} in two consecutive Fibonacci numbers, such as branching in trees, arrangement of leaves on a stem, the fruitlets of a pineapple, the flowering of artichoke, an uncurling fern and the arrangement of a pine cone. In addition, numerous poorly substantiated claims of Fibonacci numbers or golden sections in nature are found in popular sources, e.g. relating to the breeding of rabbits, the spirals of shells, and the curve of waves. The Fibonacci numbers are also found in the family tree of honeybees.
Przemysław Prusinkiewicz advanced the idea that real instances can in part be understood as the expression of certain algebraic constraints on free groups, specifically as certain Lindenmayer grammars.
Illustration of Vogel's model for n=1 ... 500
A model for the pattern of florets in the head of a sunflower was proposed by H. Vogel in 1979. This has the form

where n is the index number of the floret and c is a constant scaling factor; the florets thus lie on Fermat's spiral. The divergence angle, approximately 137.51°, is the golden angle, dividing the circle in the golden ratio. Because this ratio is irrational, no floret has a neighbor at exactly the same angle from the center, so the florets pack efficiently. Because the rational approximations to the golden ratio are of the form F(j):F(j + 1), the nearest neighbors of floret number n are those at n ± F(j) for some index j which depends on r, the distance from the center. It is often said that sunflowers and similar arrangements have 55 spirals in one direction and 89 in the other (or some other pair of adjacent Fibonacci numbers), but this is true only of one range of radii, typically the outermost and thus most conspicuous.
The bee ancestry code
Fibonacci numbers also appear in the description of the reproduction of a population of idealized honeybees, according to the following rules:
 If an egg is laid by an unmated female, it hatches a male or drone bee.
 If, however, an egg was fertilized by a male, it hatches a female.
Thus, a male bee will always have one parent, and a female bee will have two.
If one traces the ancestry of any male bee (1 bee), he has 1 parent (1 bee), 2 grandparents, 3 greatgrandparents, 5 greatgreatgrandparents, and so on. This sequence of numbers of parents is the Fibonacci sequence. The number of ancestors at each level, F_{n}, is the number of female ancestors, which is F_{n−1}, plus the number of male ancestors, which is F_{n−2}. (This is under the unrealistic assumption that the ancestors at each level are otherwise unrelated.) 