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 A337391 #23 Oct 11 2020 05:52:41
%S A337391 1,16,108,1024,10000,100008,1000188,10000384,100000575,1000000000,
%T A337391 10000001319,100000001088,1000000000792,10000000000536,
%U A337391 100000000001250,1000000000000000,10000000000001886,100000000000001952,1000000000000003324,10000000000000000000,100000000000000008972,1000000000000000009208
%N A337391 a(n) is the smallest n-digit number divisible by n^3.
%F A337391 a(n) = n^3 * ceiling(10^(n-1) / n^3). - _David A. Corneth_, Aug 26 2020
%e A337391 a(2) = 16, as 16 is the first 2-digit number divisible by 2^3 = 8.
%e A337391 a(3) = 108, as 108 is the first 3-digit number divisible by 3^3 = 27.
%e A337391 a(4) = 1024, as 1024 is the first 4-digit number divisible by 4^3 = 64.
%e A337391 a(5) = 10000, as 10000 is the first 5-digit number divisible by 5^3 = 125.
%t A337391 Table[n^3 * Ceiling[10^(n - 1)/n^3], {n, 1, 22}] (* _Amiram Eldar_, Aug 25 2020 *)
%o A337391 (PARI) a(n) = n^3 * ceil(10^(n-1) / n^3) \\ _David A. Corneth_, Aug 25 2020
%Y A337391 Cf. A000578, A011557, A053041 (divisible by n), A140317 (divisible by n^2).
%K A337391 nonn,easy,base
%O A337391 1,2
%A A337391 _Lukas R. Mansour_, Aug 25 2020