editing
approved
editing
approved
(PARI) a(n)=my(m=Mod(1, n), k=1); while(m, m=10^#Str(k++)*m+k); k \\ Charles R Greathouse IV, Oct 11 2015
Cf. A007908.
proposed
editing
editing
proposed
The maximum of the first 10000 terms is a(6314) = 1002902 and A007908(1002902) is a 5902910-digit number. - Rick L. Shepherd, Oct 11 2015
Rick L. Shepherd, <a href="/A075002/b075002.txt">Table of n, a(n) for n = 1..10000</a>
approved
editing
editing
approved
editing
approved
Smallest a(n) = smallest k such that concatenation 1 to A007908(k ) is divisible by n; or 0 if no such number exists.
Conjecture: For every n there exists a nonzero k such that , a(n) = kis well-defined.
a(4)= 2 as 12 is divisible by 4. a(7) = 11 as 7 divides 1234567891011 and 7 does not divide any smaller concatenations.
a(7) = 11 as 7 divides 1234567891011 and 7 does not divide any smaller concatenations.
Cf. A007908
Edited by Max Alekseyev, Sep 30 2015
approved
editing
_Amarnath Murthy (amarnath_murthy(AT)yahoo.com), _, Sep 01 2002
Conjecture: For every n there exists a non-zero nonzero k such that a(n) = k.
base,nonn,new