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 A362675 #21 May 02 2023 23:59:39
%S A362675 11,125,1025,3105,37125,251748,2051748,20491578,204713568,2046913578
%N A362675 Smallest number sharing n distinct (decimal) digits with its largest proper divisor.
%e A362675 ------------------------------------------------
%e A362675 n a(n) Largest proper divisor of a(n)
%e A362675 ------------------------------------------------
%e A362675 1 11 1
%e A362675 2 125 25
%e A362675 3 1025 205
%e A362675 4 3105 1035
%e A362675 5 37125 12375
%e A362675 6 251748 125874
%e A362675 7 2051748 1025874
%e A362675 8 20491578 10245789
%e A362675 9 204713568 102356784
%e A362675 10 2046913578 1023456789
%o A362675 (PARI) f(n) = n/factor(n)[1, 1]; \\ A032742
%o A362675 a(n) = my(k=2); while (#setintersect(Set(digits(k)), Set(digits(f(k)))) != n, k++); k; \\ _Michel Marcus_, Apr 29 2023
%o A362675 (Python)
%o A362675 from sympy import factorint
%o A362675 from itertools import count
%o A362675 def a(n):
%o A362675 lb = 2*int("1023456789"[:n])
%o A362675 return next(k for k in count(lb) if len(set(str(k)) & set(str(k//min(factorint(k))))) == n)
%o A362675 print([a(n) for n in range(1, 11)]) # _Michael S. Branicky_, Apr 29 2023
%Y A362675 Cf. A032742, A358076, A357929.
%K A362675 nonn,fini,full,base
%O A362675 1,1
%A A362675 _Wesley Ivan Hurt_, Apr 29 2023
%E A362675 a(9) from _Michel Marcus_, Apr 29 2023
%E A362675 a(10) from _Michael S. Branicky_, Apr 29 2023