This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A061760 #14 Mar 24 2023 17:04:59
%S A061760 11,12,33,24,15,36,77,48,99,110,121,132,143,154,105,176,187,108,912,
%T A061760 120,126,242,253,264,125,286,297,728,928,330,341,352,363,374,315,396,
%U A061760 703,836,936,240,164,294,344,484,405,644,1457,384,294,150,153,572,583
%N 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.
%H A061760 Harvey P. Dale, <a href="/A061760/b061760.txt">Table of n, a(n) for n = 1..1000</a> [Corrected by Sean A. Irvine]
%H A061760 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a061/A061760.java">Java program</a> (github)
%e A061760 a(14) = 154 = 14*11 and contains the digits 1 and 4.
%t A061760 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 *)
%K A061760 nonn,base,easy
%O A061760 1,1
%A A061760 _Amarnath Murthy_, May 20 2001
%E A061760 Corrected and extended by _Matthew Conroy_, May 28 2001