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!)
A051830 Fibonacci(Pn+1) mod Pn, where Pn is the n-th prime. 3
0, 0, 3, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Terms are 1 when Pn == 1 or 4 mod 5, terms are 0 when Pn == 2 or 3 mod 5.
LINKS
EXAMPLE
P3=5, Fibonacci(5-1)=3 mod 5.
MATHEMATICA
Table[Mod[Fibonacci[n+1], n], {n, Prime[Range[110]]}] (* Harvey P. Dale, Nov 27 2015 *)
CROSSREFS
Sequence in context: A260073 A196306 A107093 * A356098 A106216 A035676
KEYWORD
nonn
AUTHOR
Jud McCranie, Dec 11 1999
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 24 14:32 EDT 2024. Contains 371960 sequences. (Running on oeis4.)