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