The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #6 Mar 31 2015 13:46:13
%S 0,1,3,4,192,5,81,76,6,32,15,22,216,7,111,130,168,37,27,112,60,8,117,
%T 64,198,25,99,136,204,29,105,88,174,13,9,70,222,43,93,172,30,41,63,
%U 124,12,55,21,154,186,49,75,148,36,67,129,10,162,23,87,118,180,61,57,166,72,20,141,94,24,31,45,142,54,47,51,100,48,14,33,58,210,19,123,106,18,80,39,16,66,11,135,82,156,26,69,160,42,17,147,52
%N Index of least Fibonacci number congruent to n mod 100.
%C The analogous sequence mod 1000 does not exist, because no Fibonacci number is congruent to, e.g., 4 mod 1000.
%e a(4) = 192 because F(192) = 5972304273877744135569338397692020533504 is 4 mod 100.
%t Join[{0},With[{fibs=Fibonacci[Range[230]]},Flatten[Table[Position[fibs,_?(Mod[#,100]==n&),{1},1],{n,100}]]]] (* _Harvey P. Dale_, Mar 31 2015 *)
%o (PARI) a(n)=for(k=0,222,if(fibonacci(k)%100==n,return(k)))
%Y Cf. A023183.
%K nonn,fini,full
%O 0,3
%A _Charles R Greathouse IV_, Jul 22 2014