login
A051834
Fibonacci(Pn-1) mod Pn, where Pn is the n-th prime.
2
1, 1, 3, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1
OFFSET
1,3
COMMENTS
Terms are 0 when Pn == 1 or 4 mod 5, terms are 1 when Pn == 2 or 3 mod 5.
EXAMPLE
P3=5, Fibonacci(5-1)=3 mod 5.
CROSSREFS
KEYWORD
nonn
AUTHOR
Jud McCranie, Dec 11 1999
STATUS
approved