a(n) = Fibonacci(p(n)+1) mod p(n), where p(n) is the n-th prime.
A051830
a(n) = Fibonacci(p(n)+1) mod p(n), where p(n) is the n-th prime.
Terms
- a(0) =0a(1) =0a(2) =3a(3) =0a(4) =1a(5) =0a(6) =0a(7) =1a(8) =0a(9) =1a(10) =1a(11) =0a(12) =1a(13) =0a(14) =0a(15) =0a(16) =1a(17) =1a(18) =0a(19) =1a(20) =0a(21) =1a(22) =0a(23) =1a(24) =0a(25) =1a(26) =0a(27) =0a(28) =1a(29) =0
External references
- oeis: A051830