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 A205125 #8 Mar 30 2012 18:58:10 %S A205125 1,4,1,4,12,32,4,4,12,12,1,32,32,4,12,32,12,12,4,12,80,12,80,32,4,32, %T A205125 32,4,448,12,1,32,1,12,80,12,4,4,32,32,11264,80,32,12,12,80,4,32,1,4, %U A205125 4,32,32,32,448,80,4,448,80,12,24576,32,80,192,12,192,4,12,12,80 %N A205125 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>0 exists. %C A205125 For a guide to related sequences, see A204892. %t A205125 (See the program at A205122.) %Y A205125 Cf. A205122, A204892. %K A205125 nonn %O A205125 1,2 %A A205125 _Clark Kimberling_, Jan 25 2012