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 A087217 #11 Feb 23 2025 09:25:39
%S A087217 10,12,30,24,15,36,70,48,90,100,110,120,130,140,150,160,170,180,190,
%T A087217 120,210,220,230,240,125,260,270,280,290,300,310,320,330,340,350,360,
%U A087217 370,380,390,240,410,420,430,440,450,460,470,480,490,150,510,520,530
%N A087217 In decimal representation: smallest multiple of n containing it as substring.
%C A087217 a(n) = n*A086064(n).
%H A087217 Harvey P. Dale, <a href="/A087217/b087217.txt">Table of n, a(n) for n = 1..1000</a>
%t A087217 smn[n_]:=Module[{k=2},While[SequenceCount[IntegerDigits[k*n],IntegerDigits[ n]]<1,k++];k*n]; Array[smn,60] (* _Harvey P. Dale_, Oct 02 2021 *)
%o A087217 (Python)
%o A087217 def a(n):
%o A087217 s = str(n)
%o A087217 return next(mn for mn in range(2*n, 11*n, n) if s in str(mn))
%o A087217 print([a(n) for n in range(1, 55)]) # _Michael S. Branicky_, Feb 23 2025
%K A087217 nonn,base
%O A087217 1,1
%A A087217 _Reinhard Zumkeller_, Aug 26 2003