This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A090250 Least multiple of n such that deleting the first r most significant digits yields a number divisible by n-r, for r = 0 to n-2. 0
 1, 12, 114, 1120, 11120, 111120, 1111180, 11111600, 111120840, 1111120840, 11111216600, 111111216600, 1111132216480, 11111171444240, 111111171444240, 1111111171444240, 11111111177210000, 111111111177210000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE a(5) = 11120, 5 divides 11120, 4 divides 1120, 3 divides 120, 2 divides 20. MATHEMATICA f[n_] := Block[{k = n*Ceiling[(10^n - 1)/(9n)]}, While[ Union[ Table[ Mod[ Mod[k, 10^j], j], {j, n}]] != {0}, k += n]; k]; Table[ f[n], {n, 18}] (* Robert G. Wilson v, Sep 24 2004 *) CROSSREFS a(n) >= R_n (A002275). Sequence in context: A006635 A062386 A080602 * A199702 A307820 A154247 Adjacent sequences:  A090247 A090248 A090249 * A090251 A090252 A090253 KEYWORD base,nonn AUTHOR Amarnath Murthy, Nov 27 2003 EXTENSIONS Edited, corrected and extended by Robert G. Wilson v, Sep 24 2004 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 20 03:10 EDT 2019. Contains 323412 sequences. (Running on oeis4.)