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 A205396 #5 Mar 30 2012 18:58:11 %S A205396 2,5,5,5,13,8,8,13,32,18,13,13,18,32,32,18,18,41,32,25,50,72,25,25,50, %T A205396 98,32,41,61,32,32,50,41,162,72,41,50,200,41,41,113,50,61,85,50,288, %U A205396 72,50,50,113,200,113,61,72,128,61,98,450,61,61,242,512,113,72 %N A205396 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=ceiling(j^2/2). %C A205396 For a guide to related sequences, see A204892. %t A205396 (See the program at A205394.) %Y A205396 Cf. A205394, A204892. %K A205396 nonn %O A205396 1,1 %A A205396 _Clark Kimberling_, Jan 27 2012