|
%I #15 Jan 23 2024 17:16:22
%S 1,1,1,1,1,1,1,1,1,0,1,37,8547,15873,37,0,65359477124183,37,
%T 5847953216374269,0,37,1,48309178743961352657,37,0,8547,37,15873,
%U 38314176245210727969348659,0,3584229390681,0,1,65359477124183
%N Smallest k such that k*n contains a single digit with multiplicity, or 0 if no such number exists.
%C a(n) = 0 if n = 10m, 16m or 25m.
%D Amarnath Murthy, "On the divisors of the Smarandache Unary sequence," Smarandache Notions Journal, Volume 11, 1-2-3, Spring 2000.
%H Bo Gyu Jeong, <a href="/A083117/b083117.txt">Table of n, a(n) for n = 1..1000</a>
%H Bo Gyu Jeong, <a href="/A083117/a083117.cpp.txt">C++ code which computes A083116 and this sequence</a>
%o (Python)
%o from itertools import count
%o def A083117(n):
%o if not (n%10 and n%16 and n%25): return 0
%o for l in count(1):
%o k = (10**l-1)//9
%o for a in range(1,10):
%o b, c = divmod(a*k,n)
%o if not c:
%o return b # _Chai Wah Wu_, Jan 23 2024
%Y Cf. A083116, A083118.
%K base,nonn
%O 1,12
%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 23 2003
%E a(21) corrected by _Bo Gyu Jeong_, Jun 12 2012
%E More terms from _Bo Gyu Jeong_, Jun 13 2012
|
