login
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
OFFSET
1,3
COMMENTS
Terms are 1 when Pn == 1 or 4 mod 5, terms are 0 when Pn == 2 or 3 mod 5.
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
KEYWORD
nonn
AUTHOR
Jud McCranie, Dec 11 1999
STATUS
approved