login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076519 Numbers n such that Fibonacci(n) == prime(n) (mod n). 0
1, 2, 3, 4, 68, 76, 116, 181, 357, 789, 1251, 3861, 40087, 125902, 201986, 251737, 846623, 936418, 1327269, 2003626, 3546266, 4124468, 4832054, 4866214, 5086202, 5627521, 92660777, 331915497, 339145743, 394668171, 472845243, 679387634 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(33) > 2*10^9. - Giovanni Resta, Jul 20 2013
LINKS
MATHEMATICA
Select[Range[3*10^4], Mod[Fibonacci[ # ], # ] == Mod[Prime[ # ], # ] &]
CROSSREFS
Sequence in context: A004855 A097930 A012322 * A066776 A115901 A073325
KEYWORD
nonn
AUTHOR
Joseph L. Pe, Oct 17 2002
EXTENSIONS
a(13)-a(32) from Giovanni Resta, Jul 20 2013
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 April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)