A135957 a(n) = smallest k such that Fibonacci(prime(k)) has exactly n prime factors.
1, 2, 8, 12, 25, 50, 96, 73, 164
Offset: 0
Extensions
Edited and extended by David Wasserman, Mar 26 2008
This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.