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

Links

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

Crossrefs

A135958 gives prime(k). Cf. A000045, A001605, A050937, A075737, A134787, A134852.

Sequence in context: A277804 A108978 A269968 * A107755 A268836 A027718

Adjacent sequences: A135954 A135955 A135956 * A135958 A135959 A135960

Keyword

nonn,hard,less

Author

Artur Jasinski, Dec 08 2007

Extensions

Edited and extended by David Wasserman, Mar 26 2008

Status

approved