|
%I #26 Apr 17 2020 10:41:02
%S 9876543210,4938271605,3292181070,2469135780,1975308642,1646090535,
%T 1410934743,1234567890,1097393690,987654321,897865830,823045260,
%U 759734010,705467358,658436214,617283945,580973130,548696845,519818058,493827156,470311581,448932915,429414840
%N a(n) is the greatest k >= 0 such that n*k has distinct decimal digits.
%H David A. Corneth, <a href="/A328291/b328291.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A328291/a328291_1.gp.txt">PARI program for A328291</a>
%F a(n) = A328292(n) / n.
%F n * a(n) <= 9876543210 for any n > 0.
%F a(n) = 0 for any n > 9876543210.
%F a(100*n) = 0 for any n > 0.
%F a(n) >= 1 for any n in A010784.
%F 1 <= a(n) <= 9 for any n in A050278.
%o (PARI) \\ See Links section.
%o (Python)
%o from __future__ import division
%o def A328291(n):
%o if n > 9876543210 or n % 100 == 0:
%o return 0
%o k = 9876543210//n
%o m = k*n
%o s = str(m)
%o while len(set(s)) != len(s):
%o k -= 1
%o m -= n
%o s = str(m)
%o return k # _Chai Wah Wu_, Oct 13 2019
%Y Cf. A010784, A050278, A328292.
%K nonn,base,easy
%O 1,1
%A _Rémy Sigrist_, Oct 11 2019.
%E Formula corrected and program amended by _Rémy Sigrist_, Oct 14 2019
| 