Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005478
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A005478 M0741
%S A005478 2,3,5,13,89,233,1597,28657,514229,433494437,2971215073,
%T A005478 99194853094755497,1066340417491710595814572169,19134702400093278081449423917,
%U A005478 475420437734698220747368027166749382927701417016557193662268716376935476241
%N A005478 Prime Fibonacci numbers.
%D A005478 J. Brillhart, P. L. Montgomery and R. D. Silverman, Tables of Fibonacci 
               and Lucas factorizations, Math. Comp. 50 (1988), 251-260.
%D A005478 J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 89, p. 32, Ellipses, 
               Paris 2008.
%D A005478 Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas 
               n-step Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 
               05.4.4.
%D A005478 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A005478 N. J. A. Sloane, <a href="b005478.txt">Table of n, a(n) for n = 1..23</
               a>
%H A005478 R. Knott, <a href="http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/
               fibmaths.html">Mathematics of the Fibonacci Series</a>
%H A005478 Mravinci, PlanetMath.org, <a href="http://planetmath.org/encyclopedia/
               ProofThatItIsImpossibleToConstructAFibonacciLikeSequenceConsistingEntirelyOfPrimes.html">
               Proof that it is impossible to construct a Fibonacci-like sequence 
               consisting entirely of primes</a>
%H A005478 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               FibonacciNumber.html">Link to a section of The World of Mathematics.</
               a>
%F A005478 a(n)=A000045(A001605(n)). A000040 INTERSECT A000045. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Nov 01 2007
%t A005478 a={};Do[f=Fibonacci[n];If[PrimeQ[f],AppendTo[a,f]],{n,1,10^2,1}];a (Vladimir 
               Orlovsky, Jul 21 2008)
%o A005478 (PARI) je=[]; for(n=0,400, if(isprime(fibonacci(n)),je=concat(je,fibonacci(n)))); 
               je
%Y A005478 Cf. A001605, A000045.
%Y A005478 Cf. A030426, A075736.
%Y A005478 Sequence in context: A139589 A152114 A139095 this_sequence A117740 A041047 
               A120494
%Y A005478 Adjacent sequences: A005475 A005476 A005477 this_sequence A005479 A005480 
               A005481
%K A005478 nonn,nice
%O A005478 1,1
%A A005478 N. J. A. Sloane (njas(AT)research.att.com).
%E A005478 Sequence corrected by Enoch Haga (Enokh(AT)comcast.net), Feb 11 2000
%E A005478 One more term from Jason Earls (zevi_35711(AT)yahoo.com), Jul 12 2001

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research