Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087384
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087384 a(n) = smallest prime == 1 (mod F(n)) where F(n) is the n-th Fibonacci number. +0
1
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; listen)
OFFSET

0,1

EXAMPLE

Prime corresponding to the Fibonacci number 13 is 53.

CROSSREFS

Adjacent sequences: A087381 A087382 A087383 this_sequence A087385 A087386 A087387

Sequence in context: A141559 A043550 A036060 this_sequence A127165 A100683 A049905

KEYWORD

nonn

AUTHOR

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

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research