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 A204923 #9 Mar 16 2022 19:59:45 %S A204923 1,2,5,4,9,8,7,14,18,13,12,11,20,34,60,19,35,18,17,16,27,37,58,65,32, %T A204923 26,29,40,25,128,24,23,22,35,191,65,87,42,141,131,52,34,39,37,60,58, %U A204923 33,65,74,32,128,31,30,29,44,125,59,56,286,226 %N A204923 Least k such that n divides A204922(k), the k-th difference of two distinct Fibonacci numbers. %C A204923 For a guide to related sequences, see A204892. %H A204923 G. C. Greubel, <a href="/A204923/b204923.txt">Table of n, a(n) for n = 1..1000</a> %t A204923 (See the program at A204924.) %Y A204923 Cf. A204922, A204924, A204892. %K A204923 nonn %O A204923 1,2 %A A204923 _Clark Kimberling_, Jan 21 2012