Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135958
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135958 a(n) = smallest prime p such that Fibonacci(p) has exactly n prime factors. +0
7
2, 3, 19, 37, 97, 229, 503, 367, 971 (list; graph; listen)
OFFSET

0,1

FORMULA

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

CROSSREFS

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

Sequence in context: A040145 A142955 A088790 this_sequence A163665 A051079 A051089

Adjacent sequences: A135955 A135956 A135957 this_sequence A135959 A135960 A135961

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research