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 A204928 #15 Mar 17 2022 01:11:59 %S A204928 1,2,3,4,5,6,7,8,18,10,11,12,13,42,225,16,34,18,19,20,21,88,230,144, %T A204928 50,26,54,84,29,2550,31,32,33,34,17710,144,555,76,4173,2440,123,42,86, %U A204928 88,225,230,47,144,343,50,2550,52,53,54,55,2576,228,232,121304 %N A204928 s(k(n)) - s(j(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 A204928 The ordering of the pairs (s(k(n)), s(j(n))) is given by A204922. For a guide to related sequences, see A204892. %H A204928 G. C. Greubel, <a href="/A204928/b204928.txt">Table of n, a(n) for n = 1..1000</a> %t A204928 (See the program at A204924.) %Y A204928 Cf. A204900, A204892, A204929. %K A204928 nonn %O A204928 1,2 %A A204928 _Clark Kimberling_, Jan 21 2012