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 A023177 #27 Mar 05 2025 16:54:16 %S A023177 1,3,6,54,174,246,366,534,606,654,894,966,1086,1374,1446,1614,1686, %T A023177 2046,2094,2214,2334,2406,2454,2526,2694,2766,3054,3126,3246,3414, %U A023177 3606,3846,3966,4206,4254,4566,4614,4854,4926,4974,5286,5382,5406,5574,5646,6054 %N A023177 Numbers k such that Fibonacci(k) == 8 (mod k). %H A023177 Robert Israel, <a href="/A023177/b023177.txt">Table of n, a(n) for n = 1..10000</a> %F A023177 A002708(a(n)) = 8 (for n >= 4). - _Robert Israel_, Mar 05 2025 %p A023177 filter:= n -> combinat:-fibonacci(n) - 8 mod n = 0: %p A023177 select(filter, [$1..10^4]); # _Robert Israel_, Mar 05 2025 %t A023177 Select[Range[6100], Mod[Fibonacci[#] - 8, #]==0&] (* _Harvey P. Dale_, Sep 21 2021 *) %Y A023177 Cf. A000045, A002708, A023165, A023173, A023174, A023175, A023176. %K A023177 nonn %O A023177 1,2 %A A023177 _David W. Wilson_ %E A023177 Definition clarified by _N. J. A. Sloane_, Sep 21 2021