OFFSET
1,1
COMMENTS
It appears that a(n) is the intersection ( or a subset of the intersection ) of A113192[n], Primes that are the difference of two Lucas numbers and A113188[n], Primes that are the difference of two Fibonacci numbers, excluding A113192[1] = A113188[1] = 2. - Alexander Adamchuk, Aug 06 2006
For n>2 also: Primes which are the sum of four consecutive Fibonacci numbers, a(n) = A153867(n-2), cf. link to SeqFan list (Apr. 2014). - M. F. Hasler, Apr 24 2014
Conjectures: 7, 47 and 2207 are the only a(n) mod 10 = 7. They are also the only a(n) values where the Lucas index is not a prime. See A001606 for the Lucas index values of these primes. See A266587 for the divisibility of Lucas numbers by powers of primes. - Richard R. Forberg, Mar 24 2016
REFERENCES
R. K. Guy, Unsolved Problems in Number Theory, Section A3.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
T. D. Noe, Table of n, a(n) for n = 1..28
J. Brillhart, P. L. Montgomery and R. D. Silverman, Tables of Fibonacci and Lucas factorizations, Math. Comp. 50 (1988), 251-260.
Harvey P. Dale and others, A005479 and A153867, SeqFan list, Apr 24 2014.
Blair Kelly, Factorizations of Lucas numbers
Ron Knott, The First 200 Lucas numbers and their factors.
Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4.
Eric Weisstein's World of Mathematics, Lucas Number
MATHEMATICA
Select[LucasL[Range[0, 250]], PrimeQ] (* Harvey P. Dale, Nov 02 2011 *)
CROSSREFS
KEYWORD
nonn,nice
AUTHOR
EXTENSIONS
One further term (from the Knott web site) from Parthasarathy Nambi, Jun 27 2008
STATUS
approved