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 A205133 #8 Mar 30 2012 18:58:10 %S A205133 1,1,6,1,1,15,1,1,6,15,6,6,15,1,15,1,28,1,28,6,45,6,45,15,66,153,1,91, %T A205133 91,15,91,1,120,276,15,45,153,28,6,45,190,66,190,1,1,45,231,6,6,28,15, %U A205133 120,325,66,66,45,6,861,378,6 %N A205133 The number s(j) such that n divides s(k)-s(j), where s(j)=j*(2*j-1) and k is the least positive integer for which such a j exists. %C A205133 For a guide to related sequences, see A204892. %t A205133 (See the program at A205130.) %Y A205133 Cf. A205130, A204892. %K A205133 nonn %O A205133 1,3 %A A205133 _Clark Kimberling_, Jan 25 2012