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 A183198 #4 Mar 30 2012 18:57:12
%S A183198 2,1,2,3,1,2,1,4,2,3,1,2,3,1,3,2,3,1,3,2,3,1,4,2,3,1,5,3,2,3,1,4,3,2,
%T A183198 4,1,4,2,3,4,1,4,3,2,3,1,5,3,2,3,5,1,4,3,2,3,6,1,4,3,2,3,1,7,4,3,2,3,
%U A183198 6,1,4,3,2,3,5,1,4,3,2,3,4,1,6,4,3,2,3,5,1,5,3,2,3,4,6,1,4,3,2,3
%N A183198 Least integer k such that Floor(k*(n+1)^(2/3))<k*n^(2/3).
%t A183198 Table[k=1; While[Floor[k*(n+1)^(2/3)]<=k*n^(2/3), k++]; k, {n,100}]
%Y A183198 Cf. A183197.
%K A183198 nonn
%O A183198 1,1
%A A183198 _Clark Kimberling_, Dec 29 2010