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 A082527 #6 Mar 30 2012 18:39:17 %S A082527 1,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5, %T A082527 5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, %U A082527 6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 %N A082527 Least k such that x(k)=0 where x(1)=n x(k)=k^2*floor(x(k-1)/k^2). %F A082527 a(n) seems to be asymptotic to (c*n)^(1/3) where c=4.96.... %e A082527 If x(1)=3 x(2)=4*floor(3/4)=0 hence a(3)=2, if x(1)=10 x(2)=4*floor(10/4)=2 x(3)=0 hence a(10)=3... %o A082527 (PARI) a(n)=if(n<0,0,s=n; c=1; while(s-s%(c^2)>0,s=s-s%(c^2); c++); c) %Y A082527 Cf. A073047. %K A082527 nonn %O A082527 0,2 %A A082527 _Benoit Cloitre_, Apr 30 2003