a(n) = least k such that Fibonacci(k) ends with n, or -1 if there are none.

Terms

a(0) =0a(1) =1a(2) =3a(3) =4a(4) =9a(5) =5a(6) =21a(7) =14a(8) =6a(9) =11a(10) =15a(11) =22a(12) =216a(13) =7a(14) =111a(15) =130a(16) =168a(17) =37a(18) =27a(19) =112a(20) =60a(21) =8a(22) =117a(23) =64a(24) =198a(25) =25a(26) =99a(27) =136a(28) =204a(29) =29