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 A083378 #30 Aug 01 2019 00:06:48 %S A083378 1,2,5,12,27,58,125,271,584,1259,2714,5848,12599,27144,58480,125992, %T A083378 271441,584803,1259921,2714417,5848035,12599210,27144176,58480354, %U A083378 125992104,271441761,584803547,1259921049,2714417616,5848035476 %N A083378 a(n) is the largest integer whose cube has n digits and first digit 1, except that a(2)=2. %C A083378 a(2)=2 because there is no integer with cube between 10 and 19. %C A083378 A generalization to arbitrary powers is found in Hürlimann, 2004. %H A083378 W. Hürlimann, <a href="http://www.ijpam.eu/contents/2004-11-1/4/4.pdf">Integer powers and Benford's law</a>, International Journal of Pure and Applied Mathematics, vol. 11, no. 1, pp. 39-46, 2004. %H A083378 <a href="/index/Be#Benford">Index entries for sequences related to Benford's law</a> %F A083378 a(n) = floor((10^n/5)^(1/3)). %t A083378 Floor[Power[(10^Range[30])/5, (3)^-1]] (* _Harvey P. Dale_, Jul 15 2011 *) %Y A083378 Cf. A061439, A083377, A083379, A083380. %K A083378 base,easy,nonn %O A083378 1,2 %A A083378 Werner S. Hürlimann (whurlimann(AT)bluewin.ch), Jun 05 2003 %E A083378 Edited by _Don Reble_, Nov 05 2005