|
%I #11 Oct 11 2015 23:45:58
%S 1,2,2,2,5,2,11,6,8,10,106,2,11,22,5,6,21,8,27,20,11,106,33,6,25,30,
%T 26,24,31,20,46,6,113,64,45,36,21,64,11,20,3,24,19,128,35,68,8,6,53,
%U 50,21,120,83,26,135,128,27,82,104,20
%N a(n) = smallest k such that A007908(k) is divisible by n.
%C Conjecture: For every n, a(n) is well-defined.
%C 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
%H Rick L. Shepherd, <a href="/A075002/b075002.txt">Table of n, a(n) for n = 1..10000</a>
%e a(4) = 2 since A007908(2)=12 is divisible by 4.
%e a(7) = 11 as 7 divides A007908(11)=1234567891011 and 7 does not divide any smaller concatenations.
%o (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
%Y Cf. A007908.
%K base,nonn
%O 1,2
%A _Amarnath Murthy_, Sep 01 2002
%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 19 2003
%E Edited by _Max Alekseyev_, Sep 30 2015
|
