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 A220168 #28 Oct 04 2024 00:26:35 %S A220168 1,4,34,46,88,94,106,166,214,226,274,334,346,394,454,466,514,526,586, %T A220168 634,646,694,706,754,766,886,934,1006,1114,1126,1174,1186,1234,1294, %U A220168 1306,1354,1366,1486,1546,1594,1654,1714,1726,1774,1894,1906,1954,1966,2026 %N A220168 Numbers k that divide Fibonacci(k+2). %H A220168 Giovanni Resta, <a href="/A220168/b220168.txt">Table of n, a(n) for n = 1..1000</a> %t A220168 Select[Range[2000], Mod[Fibonacci[#+2], #] == 0 &] (* _T. D. Noe_, Feb 05 2014 *) %o A220168 (Python) %o A220168 prpr = prev = 1 %o A220168 for i in range(3, 3000): %o A220168 prpr, prev = prev, prpr+prev %o A220168 if prev % (i-2) == 0: print(i-2, end=', ') %o A220168 (PARI) is(n)=((Mod([1,1;1,0],n))^(n+2))[1,2]==0 \\ _Charles R Greathouse IV_, Feb 03 2014 %Y A220168 Cf. A000045. %Y A220168 Cf. A023172 (numbers k that divide Fibonacci(k)). %Y A220168 Cf. A069104 (numbers k that divide Fibonacci(k+1)). %Y A220168 Cf. A123976 (numbers k that divide Fibonacci(k-1)). %Y A220168 Cf. A159051 (numbers k that divide Fibonacci(k-2)). %K A220168 nonn %O A220168 1,2 %A A220168 _Alex Ratushnyak_, May 03 2013