OFFSET
1,1
COMMENTS
See A001605, which is the main entry for Fibonacci primes, for the latest information. - N. J. A. Sloane, Jul 09 2016
Or, A001519(n) is prime. - Zak Seidov, Jul 04 2016
LINKS
C. Caldwell's FibonacciPrime pages.
H. Dubner and W. Keller, New Fibonacci and Lucas Primes, Math. Comp. 68 (1999) 417-427.
PRP Top Records, Search for: F(n)
FORMULA
EXAMPLE
If n=69 then F(2*n - 1) is a prime with 29 digits.
MATHEMATICA
Select[Range[2500], PrimeQ[Fibonacci[2# - 1]] &] (* Stefan Steinerberger, Apr 06 2006 *)
PROG
(PARI) { for(n=1, 10000, if ( isprime( fibonacci(2*n-1) ), print1(n, ", "); ); ); } \\ R. J. Mathar, Apr 07 2006
CROSSREFS
KEYWORD
nonn
AUTHOR
Parthasarathy Nambi, Apr 05 2006
EXTENSIONS
STATUS
approved