login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A337391 a(n) is the smallest n-digit number divisible by n^3. 0
1, 16, 108, 1024, 10000, 100008, 1000188, 10000384, 100000575, 1000000000, 10000001319, 100000001088, 1000000000792, 10000000000536, 100000000001250, 1000000000000000, 10000000000001886, 100000000000001952, 1000000000000003324, 10000000000000000000, 100000000000000008972, 1000000000000000009208 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = n^3 * ceiling(10^(n-1) / n^3). - David A. Corneth, Aug 26 2020
EXAMPLE
a(2) = 16, as 16 is the first 2-digit number divisible by 2^3 = 8.
a(3) = 108, as 108 is the first 3-digit number divisible by 3^3 = 27.
a(4) = 1024, as 1024 is the first 4-digit number divisible by 4^3 = 64.
a(5) = 10000, as 10000 is the first 5-digit number divisible by 5^3 = 125.
MATHEMATICA
Table[n^3 * Ceiling[10^(n - 1)/n^3], {n, 1, 22}] (* Amiram Eldar, Aug 25 2020 *)
PROG
(PARI) a(n) = n^3 * ceil(10^(n-1) / n^3) \\ David A. Corneth, Aug 25 2020
CROSSREFS
Cf. A000578, A011557, A053041 (divisible by n), A140317 (divisible by n^2).
Sequence in context: A163725 A269188 A165558 * A250425 A238171 A155871
KEYWORD
nonn,easy,base
AUTHOR
Lukas R. Mansour, Aug 25 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 17:08 EDT 2024. Contains 371749 sequences. (Running on oeis4.)