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!)
 A066557 Largest n-digit multiple of n. 4
 9, 98, 999, 9996, 99995, 999996, 9999997, 99999992, 999999999, 9999999990, 99999999990, 999999999996, 9999999999990, 99999999999998, 999999999999990, 9999999999999984, 99999999999999990, 999999999999999990, 9999999999999999990, 99999999999999999980 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harry J. Smith, Table of n, a(n) for n = 1..150 FORMULA a(n) = floor((10^n-1)/n)*n. PROG (PARI) { for (n=1, 150, write("b066557.txt", n, " ", floor((10^n - 1)/n)*n) ) } \\ Harry J. Smith, Feb 22 2010 CROSSREFS Cf. A053041, A066558. Sequence in context: A225608 A220490 A024115 * A289214 A121706 A306567 Adjacent sequences:  A066554 A066555 A066556 * A066558 A066559 A066560 KEYWORD nonn,base AUTHOR Amarnath Murthy, Dec 17 2001 EXTENSIONS More terms and formula from Francisco Salinas (franciscodesalinas(AT)hotmail.com), Dec 24 2001 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 February 24 21:23 EST 2020. Contains 332211 sequences. (Running on oeis4.)