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 A205029 #5 Mar 30 2012 18:58:10 %S A205029 6,6,12,6,12,12,20,20,20,12,42,30,56,20,42,72,90,20,110,42,72,42,156, %T A205029 30,56,56,56,30,240,42,272,272,72,90,72,42,380,110,90,42,462,72,506, %U A205029 56,110,156,600,90,110,56,132,72,756,56,182,132,156,240,930,72 %N A205029 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=j*(j+1). %C A205029 For a guide to related sequences, see A204892. %t A205029 (See the program at A205018.) %Y A205029 Cf. A205018, A204892. %K A205029 nonn %O A205029 1,1 %A A205029 _Clark Kimberling_, Jan 22 2012