login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061760 Least multiple of n that is greater than n, not equal to a power of 10 times n and contains all the digits of n. 3

%I

%S 11,12,33,24,15,36,77,48,99,110,121,132,143,154,105,176,187,108,912,

%T 120,126,242,253,264,125,286,297,728,928,330,341,352,363,374,315,396,

%U 703,836,936,240,164,294,344,484,405,644,1457,384,294,150,153,572,583

%N Least multiple of n that is greater than n, not equal to a power of 10 times n and contains all the digits of n.

%H Harvey P. Dale, <a href="/A061760/b061760.txt">Table of n, a(n) for n = 1..1000</a>

%e a(14) = 154 = 14*11 and contains the digits 1 and 4.

%t lmn[n_]:=Module[{k=2,dcn=DigitCount[n]},While[Min[DigitCount[k*n]-dcn]<0||Divisible[k,10],k++];k*n]; Array[lmn,60] (* _Harvey P. Dale_, May 02 2015 *)

%K nonn,base,easy

%O 1,1

%A _Amarnath Murthy_, May 20 2001

%E Corrected and extended by _Matthew Conroy_, May 28 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 14 12:18 EST 2019. Contains 329114 sequences. (Running on oeis4.)