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 A328287 #21 Jan 17 2020 10:45:56
%S A328287 0,986409,438404,572175,219202,109601,255752,140515,109601,432645,0,
%T A328287 90212,127163,75768,62436,65027,56104,57930,194244,51869,0,81493,
%U A328287 40572,42969,63654,27400,33587,145926,31217,34146,0,31827,27926,51090,25772,15702,97114,26330,23106,43929,0,23983,36409
%N A328287 Number of multiples of n which have only distinct and nonzero digits in base 10.
%C A328287 This is column 0 of A328288, extension of A328277.
%C A328287 No term can exceed a(1), cf. example. The sequence is finite in the sense that a(n) = 0 for n > 987654321, since one cannot have more than 9 distinct nonzero digits.
%C A328287 See A328290 for generalization to other bases.
%H A328287 Rémy Sigrist, <a href="/A328287/a328287.gp.txt">PARI program for A328287</a>
%F A328287 a(n) = 0 whenever n == 0 (mod 10) or n > 987654321.
%e A328287 For n = 1, this is simply the number of numbers with only distinct and nonzero digits. All other terms are less than a(1), namely, the size of the subset of these numbers which are multiples of n.
%o A328287 (PARI) A328287(n,B=10,S)={for(L=1,B-1,my(T=vectorv(L,k,B^(k-1))); forperm(L,p,u=vecextract(T,p);forvec(d=vector(L,i,[1,B-1]),d*u%n||S++,2)));S} \\ 2nd optional argument allows to specify a base different from 10
%o A328287 (PARI) See Links section
%Y A328287 Cf. A328288, A328277.
%Y A328287 This is row 10 of A328290.
%K A328287 nonn,base
%O A328287 0,2
%A A328287 _M. F. Hasler_, Oct 10 2019