|
|
A117595
|
|
Numbers n such that F(2*n - 1) is prime, where F(m) is a Fibonacci number.
|
|
3
|
|
|
2, 3, 4, 6, 7, 9, 12, 15, 22, 24, 42, 66, 69, 180, 216, 217, 225, 255, 285, 286, 1486, 2362, 2694, 4656, 4839, 7216, 12781, 15379, 18000, 18756, 25417, 40920, 52456, 65011, 74046, 100554, 198690, 216891, 295021, 296845, 302356
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
If n=69 then F(2*n - 1) is a prime with 29 digits.
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) { for(n=1, 10000, if ( isprime( fibonacci(2*n-1) ), print1(n, ", "); ); ); } \\ R. J. Mathar, Apr 07 2006
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|