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 A187584 #21 Feb 25 2021 02:21:40
%S A187584 2,24,248,2364,27384,243768,23469768,1234759680
%N A187584 Least number divisible by at least n of its digits, different and > 1.
%C A187584 a(1)=2=A185186(1), a(2)=24=A187516(1),
%C A187584 a(3)=248=A187398(1), a(4)=2364=A187238(1),
%C A187584 a(5)=27384=A187533(1), a(6)=243768=A187534(1),
%C A187584 a(7)=23469768=A187551(1), a(8)=1234759680=A187565(1).
%t A187584 divQ[m_, n_] := Length[(u = Union[Select[IntegerDigits[m], # > 1 &]])] >= n && Plus @@ (Boole@Divisible[m, u]) >= n; a[n_] := Module[{k = 1}, While[! divQ[k, n], k++]; k]; Array[a, 8] (* _Amiram Eldar_, Aug 30 2020 *)
%o A187584 (Python)
%o A187584 def c(n): return len(set(d for d in str(n) if d>'1' and n%int(d)==0))
%o A187584 def a(n):
%o A187584 m = 2*10**(n-1)
%o A187584 while c(m) < n: m += 1
%o A187584 return m
%o A187584 print([a(n) for n in range(1, 7)]) # _Michael S. Branicky_, Feb 24 2021
%Y A187584 Cf. A185186, A187238, A187398, A187516, A187533, A187534, A187551, A187565.
%K A187584 nonn,base,fini,full
%O A187584 1,1
%A A187584 _Zak Seidov_, Mar 11 2011
%E A187584 a(8) corrected by _David A. Corneth_, Aug 30 2020