a(n) = 2^n mod Fibonacci(n).
A057862
a(n) = 2^n mod Fibonacci(n).
Terms
- a(0) =0a(1) =0a(2) =0a(3) =1a(4) =2a(5) =0a(6) =11a(7) =4a(8) =2a(9) =34a(10) =1a(11) =64a(12) =37a(13) =173a(14) =438a(15) =394a(16) =118a(17) =1160a(18) =1663a(19) =1a(20) =6466a(21) =14508a(22) =20764a(23) =38368a(24) =18257a(25) =99928a(26) =64234a(27) =202972a(28) =15836a(29) =410224
External references
- oeis: A057862