login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086599 Number of prime factors in Lucas(n), counting multiplicity. 2
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; internal format)
OFFSET

1,3

LINKS

Eric Weisstein's World of Mathematics, Lucas Number

Blair Kelly, Fibonacci and Lucas Factorizations

MATHEMATICA

Lucas[n_] := Fibonacci[n+1] + Fibonacci[n-1]; Join[{0}, Table[Plus@@(Transpose[FactorInteger[Lucas[n]]][[2]]), {n, 2, 150}]]

CROSSREFS

Cf. A000204 (Lucas numbers), A086598 (number of distinct prime factors), A086600 (number of primitive prime factors).

Sequence in context: A117502 A030360 A095374 * A181846 A030272 A157128

Adjacent sequences:  A086596 A086597 A086598 * A086600 A086601 A086602

KEYWORD

hard,nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Jul 24 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:13 EST 2012. Contains 205617 sequences.