|
%I M0741 #75 Apr 03 2023 10:36:09
%S 2,3,5,13,89,233,1597,28657,514229,433494437,2971215073,
%T 99194853094755497,1066340417491710595814572169,
%U 19134702400093278081449423917,475420437734698220747368027166749382927701417016557193662268716376935476241
%N Prime Fibonacci numbers.
%C a(n) == 1 (mod 4) for n > 2. (Proof. Otherwise 3 < a(n) = F_k == 3 (mod 4). Then k == 4 (mod 6) (see A079343 and A161553) and so k is not prime. But k is prime since F_k is prime and k != 4 - see Caldwell.)
%C More generally, A190949(n) == 1 (mod 4). - _N. J. A. Sloane_
%C With the exception of 3, every term of this sequence has a prime index in the sequence of Fibonacci numbers (A000045); e.g., 5 is the fifth Fibonacci number, 13 is the seventh Fibonacci number, 89 the eleventh, etc. - _Alonso del Arte_, Aug 16 2013
%C Note: A001605 gives those indices. - _Antti Karttunen_, Aug 16 2013
%C The six known safe primes 2p + 1 such that p is a Fibonacci prime are in A263880; the values of p are in A155011. There are only two known Fibonacci primes p for which 2p - 1 is also prime, namely, p = 2 and 3. Is there a reason for this bias toward prime 2p + 1 over 2p - 1 among Fibonacci primes p? - _Jonathan Sondow_, Nov 04 2015
%D J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 89, p. 32, Ellipses, Paris 2008.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H N. J. A. Sloane, <a href="/A005478/b005478.txt">Table of n, a(n) for n = 1..23</a>
%H J. Brillhart, P. L. Montgomery and R. D. Silverman, <a href="http://dx.doi.org/10.1090/S0025-5718-1988-0917832-6">Tables of Fibonacci and Lucas factorizations</a>, Math. Comp. 50 (1988), 251-260.
%H C. Caldwell's The Top Twenty, <a href="https://t5k.org/top20/page.php?id=39">Fibonacci Number</a>.
%H Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibmaths.html">Mathematics of the Fibonacci Series</a>
%H Tony D. Noe and Jonathan Vos Post, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL8/Noe/noe5.html">Primes in Fibonacci n-step and Lucas n-step Sequences</a>, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/FibonacciPrime.html">Fibonacci Prime</a>
%F a(n) = A000045(A001605(n)). A000040 INTERSECT A000045. - _R. J. Mathar_, Nov 01 2007
%t Select[Fibonacci[Range[400]], PrimeQ] (* _Alonso del Arte_, Oct 13 2011 *)
%o (PARI) je=[]; for(n=0,400, if(isprime(fibonacci(n)),je=concat(je,fibonacci(n)))); je
%o (Sage) [i for i in fibonacci_xrange(0,10^80) if is_prime(i)] # _Bruno Berselli_, Jun 26 2014
%Y Cf. A001605, A000045, A030426, A075736, A099000, A263880.
%Y Subsequence of A178762.
%Y Column k=1 of A303216.
%K nonn,nice,easy
%O 1,1
%A _N. J. A. Sloane_
%E Sequence corrected by _Enoch Haga_, Feb 11 2000
%E One more term from _Jason Earls_, Jul 12 2001
%E Comment and proof added by _Jonathan Sondow_, May 24 2011
| 