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 A111393 #8 Dec 26 2014 13:06:46 %S A111393 1,1,2,2,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5, %T A111393 5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, %U A111393 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,7,7,7,7,7,7 %N A111393 Number of digits in n^3. %F A111393 a(n) = floor( (3*log_10(n)) + 1). %F A111393 a(n) = A055642(n^3). [_R. J. Mathar_, Mar 05 2010] %e A111393 a(10) = 4 %p A111393 A055642 :=proc(n) max(1,ilog10(n)+1) ; end proc: A111393 := proc(n) A055642(n^3) ; end proc: seq(A111393(n),n=1..90) ; # _R. J. Mathar_, Mar 05 2010 %t A111393 Array[IntegerLength[#^3]&,110] (* _Harvey P. Dale_, Dec 26 2014 *) %o A111393 (PARI) a(n)=if(n==0,1,#digits(n^3)); \\ _Joerg Arndt_, Mar 30 2014 %K A111393 base,nonn %O A111393 1,3 %A A111393 Salim Erinc (eryigit(AT)boun.edu.tr), Nov 11 2005 %E A111393 Extended by _R. J. Mathar_, Mar 05 2010