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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080345 a(n) is the number of prime factors in Fibonacci(Prime(n)); that is, the Fibonacci number whose index is the n-th prime. 4
0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 2, 1, 1, 2, 2, 2, 3, 2, 2, 2, 1, 2, 4, 2, 3, 2, 2, 2, 2, 1, 1, 3, 4, 2, 4, 4, 2, 2, 3, 3, 2, 2, 4, 2, 4, 4, 2, 5, 3, 4, 3, 2, 3, 3, 4, 2, 2, 3, 4, 2, 4, 4, 4, 3, 2, 3, 5, 4, 2, 1, 7, 5, 4, 3, 3, 2, 2, 4, 3, 4, 1, 1, 5, 5, 1, 3, 5, 3, 2, 3, 4, 3, 4, 6, 1, 3, 4, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,8

LINKS

T. D. Noe, Table of n, a(n) for n = 1..168

Blair Kelly, Fibonacci and Lucas Factorizations

EXAMPLE

a(12) = 3 because Fibonacci(37) = 24157817 = 73 * 149 * 2221 has 3 prime factors.

MATHEMATICA

Table[Length[FactorInteger[Fibonacci[Prime[n]]]], {n, 60}]

CROSSREFS

Cf. A001605, A014600, A022307.

Sequence in context: A072782 A122563 A204030 * A004737 A014600 A165475

Adjacent sequences:  A080342 A080343 A080344 * A080346 A080347 A080348

KEYWORD

hard,nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Feb 16 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 07:40 EST 2012. Contains 205597 sequences.