cp's OEIS Frontend

A117595 Numbers n such that F(2*n - 1) is prime, where F(m) is a Fibonacci number.

%I A117595 #31 Apr 03 2023 10:36:11
%S A117595 2,3,4,6,7,9,12,15,22,24,42,66,69,180,216,217,225,255,285,286,1486,
%T A117595 2362,2694,4656,4839,7216,12781,15379,18000,18756,25417,40920,52456,
%U A117595 65011,74046,100554,198690,216891,295021,296845,302356
%N A117595 Numbers n such that F(2*n - 1) is prime, where F(m) is a Fibonacci number.
%C A117595 See A001605, which is the main entry for Fibonacci primes, for the latest information. - _N. J. A. Sloane_, Jul 09 2016
%C A117595 Or, A001519(n) is prime. - _Zak Seidov_, Jul 04 2016
%H A117595 C. Caldwell's <a href="https://t5k.org/glossary/page.php/FibonacciPrime.html">FibonacciPrime</a> pages.
%H A117595 H. Dubner and W. Keller, <a href="http://dx.doi.org/10.1090/S0025-5718-99-00981-3">New Fibonacci and Lucas Primes</a>, Math. Comp. 68 (1999) 417-427.
%H A117595 PRP Top Records, <a href="http://www.primenumbers.net/prptop/searchform.php?form=F%28n%29&amp;action=Search">Search for: F(n)</a>
%F A117595 2*a(n)-1 = A001605(n+1) for all odd A001605(n+1). - _R. J. Mathar_, Apr 07 2006
%e A117595 If n=69 then F(2*n - 1) is a prime with 29 digits.
%t A117595 Select[Range[2500], PrimeQ[Fibonacci[2# - 1]] &] (* _Stefan Steinerberger_, Apr 06 2006 *)
%o A117595 (PARI) { for(n=1,10000, if ( isprime( fibonacci(2*n-1) ), print1(n,","); ); ); } \\ _R. J. Mathar_, Apr 07 2006
%Y A117595 Cf. A000045, A001605 (Fibonacci(n) is prime), A001519.
%K A117595 nonn
%O A117595 1,1
%A A117595 _Parthasarathy Nambi_, Apr 05 2006
%E A117595 More terms from _Stefan Steinerberger_, _T. D. Noe_ and _R. J. Mathar_, Apr 07 2006