Definition:Fibonacci Prime
From ProofWiki
Definition
A Fibonacci prime is a Fibonacci number which happens to be prime.
The first few Fibonacci primes are:
| $n$ | $F_n$ | ||
|---|---|---|---|
| $3$ | $2$ | ||
| $4$ | $3$ | ||
| $5$ | $5$ | ||
| $7$ | $13$ | ||
| $11$ | $89$ | ||
| $13$ | $233$ | ||
| $17$ | $1597$ | ||
| $23$ | $28657$ | ||
| $29$ | $514229$ | ||
| $43$ | $433494437$ | ||
| $83$ | $2971215073$ |
...etc.
It is not known whether there is an infinite number of Fibonacci primes.
Source of Name
This entry was named for Leonardo Fibonacci.
Also see
This sequence is A005478 in the On-Line Encyclopedia of Integer Sequences (N. J. A. Sloane (Ed.), 2008).
