A051834 Fibonacci(Pn-1) mod Pn, where Pn is the n-th prime.

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

Author

Jud McCranie, Dec 11 1999

Keywords

• nonn

Comments

Terms are 0 when Pn == 1 or 4 mod 5, terms are 1 when Pn == 2 or 3 mod 5.

Examples

			P3=5, Fibonacci(5-1)=3 mod 5.
		

Crossrefs

Cf. A000045, A003631, A045468, A051830, A051831.