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 A204929 #11 Mar 17 2022 01:12:20 %S A204929 1,1,1,1,1,1,1,1,2,1,1,1,1,3,15,1,2,1,1,1,1,4,10,6,2,1,2,3,1,85,1,1,1, %T A204929 1,506,4,15,2,107,61,3,1,2,2,5,5,1,3,7,1,50,1,1,1,1,46,4,4,2056,451 %N A204929 (s(k(n)) - s(j(n)))/n, where (s(k(n)), s(j(n))) is the least pair of distinct Fibonacci numbers for which n divides s(k(n)) - s(j(n)). %C A204929 For a guide to related sequences, see A204892. %H A204929 G. C. Greubel, <a href="/A204929/b204929.txt">Table of n, a(n) for n = 1..1000</a> %t A204929 (See the program at A204924.) %Y A204929 Cf. A204924, A204892, A204928. %K A204929 nonn %O A204929 1,9 %A A204929 _Clark Kimberling_, Jan 21 2012