login
A135958
a(n) = smallest prime p such that Fibonacci(p) has exactly n prime factors.
7
2, 3, 19, 37, 97, 229, 503, 367, 971
OFFSET
0,1
FORMULA
a(n) = prime(A135957(n)).
PROG
(PARI) a(n) = {p = 2; while (omega(fibonacci(p)) != n, p = nextprime(p+1)); p; } \\ Michel Marcus, Nov 08 2013
CROSSREFS
A135959 gives the Fibonacci numbers. Cf. A000045, A050937, A075737, A090819, A135957.
Sequence in context: A215153 A214890 A178202 * A265787 A163665 A323786
KEYWORD
nonn,hard,less
AUTHOR
Artur Jasinski, Dec 08 2007
EXTENSIONS
Edited and extended by David Wasserman, Mar 26 2008
STATUS
approved