login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087384 a(n) = smallest prime == 1 (mod F(n)) where F(n) is the n-th Fibonacci number. 0
2, 2, 3, 7, 11, 17, 53, 43, 103, 331, 179, 433, 467, 5279, 1831, 5923, 6389, 7753, 8363, 27061, 21893, 35423, 1146281, 92737, 3001001, 1213931, 392837, 1906867, 4113833, 4992241, 5385077, 17426473, 14098313, 91246193, 110729581, 44791057 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

EXAMPLE

Prime corresponding to the Fibonacci number 13 is 53.

CROSSREFS

Sequence in context: A043550 A036060 A065383 * A179283 A127165 A100683

Adjacent sequences:  A087381 A087382 A087383 * A087385 A087386 A087387

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 09 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.