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 A205873 #8 Mar 30 2012 18:58:12 %S A205873 3,1,5,5,10,5,10,12,8,6,1,9,4,15,2,5,10,12,13,1,9,17,11,1,9,17,22,1,9, %T A205873 17,22,24,2,20,3,7,4,18,5,10,12,13,21,6,16,3,7,27,8,14 %N A205873 The least number j such that 9 divides s(k)-s(j), where k(n)=A205872(n) and s(k) denotes the (k+1)-st Fibonacci number. %C A205873 For a guide to related sequences, see A205840. %e A205873 (See the example at A205872.) %t A205873 (See the program at A205872.) %Y A205873 Cf. A204890, A205872, A205840. %K A205873 nonn %O A205873 1,1 %A A205873 _Clark Kimberling_, Feb 02 2012