login
The OEIS is supported by the many generous donors 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
11, 12, 33, 24, 15, 36, 77, 48, 99, 110, 121, 132, 143, 154, 105, 176, 187, 108, 912, 120, 126, 242, 253, 264, 125, 286, 297, 728, 928, 330, 341, 352, 363, 374, 315, 396, 703, 836, 936, 240, 164, 294, 344, 484, 405, 644, 1457, 384, 294, 150, 153, 572, 583 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000 [Corrected by Sean A. Irvine]
Sean A. Irvine, Java program (github)
EXAMPLE
a(14) = 154 = 14*11 and contains the digits 1 and 4.
MATHEMATICA
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 *) (* WARNING Sometimes incorrect for n>=102, Sean A. Irvine, Mar 24 2023 *)
CROSSREFS
Sequence in context: A368359 A136433 A172173 * A309631 A075559 A080138
KEYWORD
nonn,base,easy
AUTHOR
Amarnath Murthy, May 20 2001
EXTENSIONS
Corrected and extended by Matthew Conroy, May 28 2001
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 08:59 EDT 2024. Contains 371935 sequences. (Running on oeis4.)