This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A214781 #25 Jun 02 2025 08:05:31
%S A214781 2,4,2,4,5,10,6,0,10,7,0,10,12,22,8,0,16,10,11,28,0,0,9,0,48,40,34,22,
%T A214781 0,34,0,0,0,16,28,10,36,0,18,0,18,0,17,0,34,22,14,0,54,148,16,40,52,
%U A214781 34,0,0,11,0,0,34,28,0,0,0,68,0,21,16
%N A214781 a(n) = smallest k>=2 such that n divides Fibonacci(k-1)+2.
%C A214781 0 is inserted if no such k exists.
%e A214781 n=1 divides F(0)+2=2. n=2 divides F(0)+2=2. n=3 divides F(1)+2=3. n=4 divides F(3)+2=4.
%o A214781 (PARI) a(n) = {k = 2; while (((fibonacci(k-1)+2) % n), k++; if (k > 6*n+2 , return(0));); return (k);} \\ _Michel Marcus_, May 30 2013
%Y A214781 Cf. A157725, A001177, A214782.
%K A214781 nonn
%O A214781 1,1
%A A214781 _Art DuPre_, Aug 03 2012