|
| |
|
|
A135957
|
|
a(n) = smallest k such that Fibonacci(prime(k)) has exactly n prime factors.
|
|
9
| | |
|
|
|
OFFSET
| 0,2
|
|
|
CROSSREFS
| A135958 gives prime(k). Cf. A000045, A001605, A050937, A075737, A134787, A134852.
Sequence in context: A162152 A013654 A108978 * A107755 A027718 A115102
Adjacent sequences: A135954 A135955 A135956 * A135958 A135959 A135960
|
|
|
KEYWORD
| nonn,hard,less
|
|
|
AUTHOR
| Artur Jasinski (grafix(AT)csl.pl), Dec 08 2007
|
|
|
EXTENSIONS
| Edited and extended by David Wasserman (dwasserm(AT)earthlink.net), Mar 26 2008
|
| |
|
|
