|
%I
%S 1,5,4,3,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,5,5,5,5,5,4,4,4,4,4,4,4,4,4,3,
%T 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%U 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1
%N Smallest number h such that the decimal expansion of n*h starts with 1.
%C Quotient of the smallest multiple of n beginning with 1 (A187285(n)) and n.
%H Nathaniel Johnston, <a href="/A190302/b190302.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A187285(n) / n.
%e For n = 7: a(7) = 2 because 2 * 7 = 14. Number 14 is the smallest number beginning with 1 divisible by 7.
%p A190302 := proc(n) local d,h: for h from 1 do d:=convert(n*h,base,10): if(d[nops(d)]=1)then return h: fi: od: end: seq(A190302(n), n=1..105); # Nathaniel Johnston, Jun 15 2011
%K nonn,easy,base
%O 1,2
%A _Jaroslav Krizek_, May 07 2011
|
