login
A135957
a(n) = smallest k such that Fibonacci(prime(k)) has exactly n prime factors.
9
1, 2, 8, 12, 25, 50, 96, 73, 164
OFFSET
0,2
CROSSREFS
Sequence in context: A277804 A108978 A269968 * A107755 A268836 A027718
KEYWORD
nonn,hard,less
AUTHOR
Artur Jasinski, Dec 08 2007
EXTENSIONS
Edited and extended by David Wasserman, Mar 26 2008
STATUS
approved