login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A135957
a(n) = smallest k such that Fibonacci(prime(k)) has exactly n prime factors.
9
1, 2, 8, 12, 25, 50, 96, 73, 164
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
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
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified May 3 15:33 EDT 2024. Contains 372218 sequences. (Running on oeis4.)