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!)
A220491 The smallest n-digit number whose last k digits are divisible by k for k = 1..n. 2
0, 10, 102, 1000, 10000, 102000, 1000300, 10000000, 102000600, 1000000000, 10000108360, 102000060480, 1000006930000, 10000063165960, 102000042276960, 1000000000000000, 10000000141981840, 102000006021375360, 1000000081060819840, 10000000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
There are ten one-digit numbers divisible by 1, and the smallest is 0, so a(1) = 0.
For two-digit numbers, the ones digit must be divisible by 2 which gives 10 as the smallest to satisfy the requirement. So a(2) = 10.
CROSSREFS
Cf. A164836.
Sequence in context: A203569 A305712 A053041 * A088644 A080502 A078283
KEYWORD
nonn,base
AUTHOR
Shyam Sunder Gupta, Aug 07 2013
EXTENSIONS
More terms from Jinyuan Wang, Mar 09 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 May 1 03:27 EDT 2024. Contains 372148 sequences. (Running on oeis4.)