|
Search: id:A005478
|
|
|
| A005478 |
|
Prime Fibonacci numbers.
(Formerly M0741)
|
|
+0
31
|
|
| 2, 3, 5, 13, 89, 233, 1597, 28657, 514229, 433494437, 2971215073, 99194853094755497, 1066340417491710595814572169, 19134702400093278081449423917, 475420437734698220747368027166749382927701417016557193662268716376935476241
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
J. Brillhart, P. L. Montgomery and R. D. Silverman, Tables of Fibonacci and Lucas factorizations, Math. Comp. 50 (1988), 251-260.
J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 89, p. 32, Ellipses, Paris 2008.
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.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
N. J. A. Sloane, Table of n, a(n) for n = 1..23
R. Knott, Mathematics of the Fibonacci Series
Mravinci, PlanetMath.org, Proof that it is impossible to construct a Fibonacci-like sequence consisting entirely of primes
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
FORMULA
|
a(n)=A000045(A001605(n)). A000040 INTERSECT A000045. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 01 2007
|
|
MATHEMATICA
|
a={}; Do[f=Fibonacci[n]; If[PrimeQ[f], AppendTo[a, f]], {n, 1, 10^2, 1}]; a (Vladimir Orlovsky, Jul 21 2008)
|
|
PROGRAM
|
(PARI) je=[]; for(n=0, 400, if(isprime(fibonacci(n)), je=concat(je, fibonacci(n)))); je
|
|
CROSSREFS
|
Cf. A001605, A000045.
Cf. A030426, A075736.
Sequence in context: A139589 A152114 A139095 this_sequence A117740 A041047 A120494
Adjacent sequences: A005475 A005476 A005477 this_sequence A005479 A005480 A005481
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Sequence corrected by Enoch Haga (Enokh(AT)comcast.net), Feb 11 2000
One more term from Jason Earls (zevi_35711(AT)yahoo.com), Jul 12 2001
|
|
|
Search completed in 0.003 seconds
|
