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 A061434 #13 Oct 09 2023 17:38:46
%S A061434 1,27,125,1000,10648,103823,1000000,10077696,100544625,1000000000,
%T A061434 10007873875,100026577288,1000000000000,10000909453625,
%U A061434 100000721719296,1000000000000000,10000073940248384,100000075387171679,1000000000000000000,10000004316234262875
%N A061434 a(n) is the smallest n-digit cube.
%F A061434 a(n) = ceiling(10^((n-1)/3))^3. - Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 30 2003
%e A061434 a(4) = 1000 = 10^3 has 4 digits while 9^3 = 729 has 3 digits.
%p A061434 A061434 := n->ceil(10^((n-1)/3))^3;
%t A061434 Table[Ceiling[Surd[10^n,3]]^3,{n,0,20}] (* _Harvey P. Dale_, Oct 09 2023 *)
%o A061434 (Python)
%o A061434 from sympy import integer_nthroot
%o A061434 def a(n):
%o A061434 r, exact = integer_nthroot(10**(n-1), 3)
%o A061434 return 10**(n-1) if exact else (r+1)**3
%o A061434 print([a(n) for n in range(1, 21)]) # _Michael S. Branicky_, Jan 27 2021
%o A061434 (PARI) a(n) = ceil(10^((n-1)/3))^3; \\ _Michel Marcus_, Jan 27 2021
%Y A061434 Cf. A000578, A061432, A061433.
%K A061434 nonn,base,easy
%O A061434 1,2
%A A061434 _Amarnath Murthy_, May 03 2001
%E A061434 More terms from Larry Reeves (larryr(AT)acm.org), May 16 2001
%E A061434 More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 30 2003