Least k >= 3 such that Fibonacci(k) == -1 (mod 3^n).

Terms

a(0) =3a(1) =6a(2) =14a(3) =38a(4) =110a(5) =326a(6) =974a(7) =2918a(8) =8750a(9) =26246a(10) =78734a(11) =236198a(12) =708590a(13) =2125766a(14) =6377294a(15) =19131878a(16) =57395630a(17) =172186886a(18) =516560654a(19) =1549681958a(20) =4649045870a(21) =13947137606a(22) =41841412814a(23) =125524238438a(24) =376572715310