A135958 a(n) = smallest prime p such that Fibonacci(p) has exactly n prime factors.

2, 3, 19, 37, 97, 229, 503, 367, 971

Offset: 0

Author

Artur Jasinski, Dec 08 2007

Keywords

• nonn
• hard
• less

Crossrefs

A135959 gives the Fibonacci numbers. Cf. A000045, A050937, A075737, A090819, A135957.

Programs

PARI

a(n) = {p = 2; while (omega(fibonacci(p)) != n, p = nextprime(p+1)); p;} \\ Michel Marcus, Nov 08 2013

Formula

a(n) = prime(A135957(n)).

Extensions

Edited and extended by David Wasserman, Mar 26 2008