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 A337817 #36 Oct 16 2022 03:20:45
%S A337817 2,0,36,900,138600,25336080,3732276240,240277237200
%N A337817 Smallest nonnegative number that has exactly n different representations as the product of a number and the sum of its decimal digits.
%C A337817 With "positive" instead "nonnegative", a(1) would be equal to 1, and other terms would not change.
%C A337817 a(8) <= 425616965373600. - _Giovanni Resta_, Oct 13 2022
%e A337817 2 is the smallest number that is not possible to write as (m * sum of digits of m) for some m, hence a(0) = 2.
%e A337817 0 = 0 * 0, hence a(1) = 0
%e A337817 36 = 6 * 6 = 12 * (1+2) and 36 is the smallest number with 2 such representations, hence a(2) = 36.
%t A337817 f[n_] := n*Plus @@ IntegerDigits[n]; m = 2*10^5; v = Table[0, {m}]; Do[i = f[n] + 1; If[i <= m, v[[i]]++], {n, 0, m}]; s = {}; k = 0; While[(p = Position[v, k]) != {}, AppendTo[s, p[[1, 1]] - 1]; k++]; s (* _Amiram Eldar_, Sep 23 2020 *)
%o A337817 (PARI) a(n)={if(n==1, 0, for(k=1, oo, if(sumdiv(k, d, d*sumdigits(d)==k) == n, return(k))))} \\ _Andrew Howroyd_, Sep 23 2020
%Y A337817 Cf. A057147, A337816.
%Y A337817 Cf. A337051 (similar for Bogotá numbers), A337732.
%K A337817 nonn,base,more
%O A337817 0,1
%A A337817 _Bernard Schott_, Sep 23 2020
%E A337817 a(3)-a(5) from _Amiram Eldar_, Sep 23 2020
%E A337817 a(6)-a(7) from _Bert Dobbelaere_, Sep 27 2020, matching upper bounds from _David A. Corneth_