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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038575 Number of prime factors of n-th Fibonacci number, with multiplicity. 8
0, 0, 0, 1, 1, 1, 3, 1, 2, 2, 2, 1, 6, 1, 2, 3, 3, 1, 5, 2, 4, 3, 2, 1, 9, 3, 2, 4, 4, 1, 7, 2, 4, 3, 2, 3, 10, 3, 3, 3, 6, 2, 7, 1, 5, 5, 3, 1, 12, 3, 6, 3, 4, 2, 8, 4, 7, 5, 3, 2, 12, 2, 3, 5, 6, 3, 7, 3, 5, 5, 7, 2, 14, 2, 4, 6, 5, 4, 8, 2, 9, 7, 3, 1, 13, 4, 3, 4, 9, 2, 12, 5, 6, 4, 2, 6, 16, 4, 5, 6, 10, 2, 8 (list; graph; refs; listen; history; internal format)
OFFSET

0,7

LINKS

T. D. Noe, Table of n, a(n) for n=0..1000 (derived from Kelly's data)

Eric Weisstein's World of Mathematics, Fibonacci Number

Blair Kelly, Fibonacci and Lucas Factorizations

EXAMPLE

a(12) = 6 because Fibonacci(12) = 144 = 2^4 * 3^2 has 6 prime factors.

MAPLE

with(numtheory):with(combinat):a:=proc(n) if n=0 then 0 else bigomega(fibonacci(n)) fi end: seq(a(n), n=0..102); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 11 2008

MATHEMATICA

Join[{0, 0}, Table[Plus@@(Transpose[FactorInteger[Fibonacci[n]]][[2]]), {n, 3, 102}]]

CROSSREFS

Cf. A022307 (number of distinct prime factors), A086597 (number of primitive prime factors).

Sequence in context: A021888 A115310 A139381 * A033178 A029418 A185736

Adjacent sequences:  A038572 A038573 A038574 * A038576 A038577 A038578

KEYWORD

nonn

AUTHOR

Jeff Burch (gburch(AT)erols.com)

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 13 13:22 EST 2012. Contains 205483 sequences.