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 A205108 #5 Mar 30 2012 18:58:10 %S A205108 5,5,19,5,65,19,19,65,19,65,665,65,2059,19,65,65,665,19,665,65,211, %T A205108 665,65,211,665,2059,19171,2059,1586131,65,19171,65,665,665,211,6305, %U A205108 19171,665,6305,665,2059,211,527345,665,6305,65,6305,211,2059,665 %N A205108 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=3^j-2^j. %C A205108 For a guide to related sequences, see A204892. %t A205108 (See the program at A205000.) %Y A205108 Cf. A205000, A204892. %K A205108 nonn %O A205108 1,1 %A A205108 _Clark Kimberling_, Jan 22 2012