login
a(n) = the smallest n-digit number ending in n-1 zeros that is divisible by n, else 0.
1

%I #9 Jan 16 2017 02:31:14

%S 1,10,300,1000,10000,300000,7000000,10000000,900000000,1000000000,0,

%T 300000000000,0,70000000000000,300000000000000,1000000000000000,0,

%U 900000000000000000,0,10000000000000000000,0,0,0,300000000000000000000000,1000000000000000000000000,0,0,7000000000000000000000000000,0

%N a(n) = the smallest n-digit number ending in n-1 zeros that is divisible by n, else 0.

%C See A173478 - A173486.

%H Robert Israel, <a href="/A173479/b173479.txt">Table of n, a(n) for n = 1..999</a>

%p f:= proc(n) local i; for i from 1 to 9 do if i*10^(n-1) mod n = 0 then return i*10^(n-1) fi od: 0 end proc:

%p map(f, [$1..20]); # _Robert Israel_, Jan 16 2017

%K nonn,base

%O 1,2

%A _Jaroslav Krizek_, Feb 19 2010

%E a(16)-a(29) from _Robert Israel_, Jan 16 2017