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

%I #27 Jan 14 2021 21:16:05

%S 0,10,102,1000,10000,102000,1000300,10000000,102000600,1000000000,

%T 10000108360,102000060480,1000006930000,10000063165960,

%U 102000042276960,1000000000000000,10000000141981840,102000006021375360,1000000081060819840,10000000000000000000

%N The smallest n-digit number whose last k digits are divisible by k for k = 1..n.

%e There are ten one-digit numbers divisible by 1, and the smallest is 0, so a(1) = 0.

%e 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.

%Y Cf. A164836.

%K nonn,base

%O 1,2

%A _Shyam Sunder Gupta_, Aug 07 2013

%E More terms from _Jinyuan Wang_, Mar 09 2020

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 19 11:14 EDT 2024. Contains 371791 sequences. (Running on oeis4.)