The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A086599 Number of prime factors in Lucas(n), counting multiplicity. 3
 1, 0, 1, 2, 1, 1, 3, 1, 1, 3, 2, 1, 3, 1, 2, 4, 1, 1, 5, 1, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 5, 1, 2, 4, 3, 4, 4, 1, 2, 5, 3, 1, 6, 2, 4, 7, 3, 1, 4, 2, 4, 5, 3, 1, 7, 5, 2, 5, 3, 3, 6, 1, 2, 7, 2, 5, 6, 2, 2, 6, 4, 1, 4, 2, 3, 8, 2, 4, 5, 1, 2, 6, 4, 2, 7, 4, 2, 6, 3, 2, 8, 3, 3, 5, 4, 5, 4, 2, 4, 8, 4, 3, 7, 3, 4, 10 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Amiram Eldar, Table of n, a(n) for n = 0..1000 (using Blair Kelly's data) Blair Kelly, Fibonacci and Lucas Factorizations Eric Weisstein's World of Mathematics, Lucas Number MATHEMATICA Lucas[n_] := Fibonacci[n+1] + Fibonacci[n-1]; Join[{0}, Table[Plus@@(Transpose[FactorInteger[Lucas[n]]][[2]]), {n, 2, 150}]] PROG (PARI) a(n)=bigomega(fibonacci(n-1)+fibonacci(n+1)) \\ Charles R Greathouse IV, Sep 14 2015 CROSSREFS Cf. A000204 (Lucas numbers), A086598 (number of distinct prime factors), A086600 (number of primitive prime factors). Sequence in context: A095374 A300650 A300649 * A181846 A305499 A210873 Adjacent sequences:  A086596 A086597 A086598 * A086600 A086601 A086602 KEYWORD hard,nonn AUTHOR T. D. Noe, Jul 24 2003 EXTENSIONS a(0) added by Amiram Eldar, Sep 01 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 26 14:17 EDT 2021. Contains 347668 sequences. (Running on oeis4.)