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,1

Links

Table of n, a(n) for n=0..8.

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

Adjacent sequences: A135955 A135956 A135957 * A135959 A135960 A135961

Keyword

nonn,hard,less

Author

Artur Jasinski, Dec 08 2007

Extensions

Edited and extended by David Wasserman, Mar 26 2008

Status

approved