Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005479
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A005479 M2627
%S A005479 2,3,7,11,29,47,199,521,2207,3571,9349,3010349,54018521,370248451,
%T A005479 6643838879,119218851371,5600748293801,688846502588399,
%U A005479 32361122672259149,412670427844921037470771
%N A005479 Prime Lucas numbers (cf. A000032).
%C A005479 Also primes of the form 2*F(n) + F(n+1) or F(n) + 3*F(n), where F(n) 
               is a Fibonacci number. - Giovanni Teofilatto, Jun 06 2004.
%C A005479 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 (alex(AT)kolmogorov.com), 
               Aug 06 2006
%D A005479 J. Brillhart, P. L. Montgomery and R. D. Silverman, Tables of Fibonacci 
               and Lucas factorizations, Math. Comp. 50 (1988), 251-260.
%D A005479 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 A005479 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A005479 B. Kelly, <a href="http://home.att.net/~blair.kelly/mathematics/fibonacci/
               lucas.txt">Factorizations of Lucas numbers</a>
%H A005479 Ron Knott, <a href="http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/
               lucas200.html"> The First 200 Lucas numbers and their factors</a>
               .
%H A005479 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               LucasNumber.html">Lucas Number</a>
%t A005479 lst={};b=2;c=1;AppendTo[lst, b];Do[b=b+c;If[PrimeQ[b], AppendTo[lst, 
               b]];c=b+c;If[PrimeQ[c], AppendTo[lst, c]], {n, 1, 15^2}];lst [From 
               Vladimir Orlovsky (4vladimir(AT)gmail.com), Aug 21 2008]
%Y A005479 Cf. A000032, A001606, A113192, A113188.
%Y A005479 Sequence in context: A112840 A014981 A096362 this_sequence A120856 A138000 
               A034295
%Y A005479 Adjacent sequences: A005476 A005477 A005478 this_sequence A005480 A005481 
               A005482
%K A005479 nonn,nice
%O A005479 1,1
%A A005479 N. J. A. Sloane (njas(AT)research.att.com).
%E A005479 One further term (from the Knott web site) from Parthasarathy Nambi (PachaNambi(AT)yahoo.com), 
               Jun 27 2008

    
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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research