The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053041 Smallest n-digit number divisible by n. 10
 1, 10, 102, 1000, 10000, 100002, 1000006, 10000000, 100000008, 1000000000, 10000000010, 100000000008, 1000000000012, 10000000000004, 100000000000005, 1000000000000000, 10000000000000016, 100000000000000008, 1000000000000000018, 10000000000000000000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harry J. Smith, Table of n, a(n) for n = 1..150 FORMULA a(n) = n*ceiling(10^(n-1)/n). - Vladeta Jovovic, Dec 27 2001 MAPLE A053041:=n->n*ceil(10^(n-1)/n); seq(A053041(n), n=1..30); # Wesley Ivan Hurt, Nov 28 2013 MATHEMATICA Table[Ceiling[10^(n-1)/n]n, {n, 20}] (* Harvey P. Dale, Jan 17 2012 *) PROG (PARI) { for (n=1, 150, write("b053041.txt", n, " ", n*ceil(10^(n-1)/n)) ) } \\ Harry J. Smith, Feb 23 2010 CROSSREFS Cf. A066559, A066209, A066557, A066558, A162213. Sequence in context: A297062 A203569 A305712 * A220491 A088644 A080502 Adjacent sequences:  A053038 A053039 A053040 * A053042 A053043 A053044 KEYWORD base,easy,nonn,nice AUTHOR Henry Bottomley, Feb 24 2000 EXTENSIONS More terms from David Wasserman, Feb 26 2002 STATUS approved

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

Last modified May 14 18:54 EDT 2021. Contains 343900 sequences. (Running on oeis4.)