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