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 A334403 #36 Mar 27 2023 03:38:07
%S A334403 198,288,378,396,468,486,558,576,594,648,666,684,738,756,774,792,828,
%T A334403 846,864,882,918,936,954,972,990,1098,1188,1278,1296,1368,1386,1458,
%U A334403 1476,1494,1548,1566,1584,1638,1656,1674,1692,1728,1746,1764,1782,1818,1836,1854
%N A334403 Harshad numbers with sum of digits equal to 18.
%C A334403 Even numbers with sum of digits equal to 18 are Harshad numbers (A005349).
%C A334403 If k is a term, then so is 10*k. - _Robert Israel_, Mar 26 2023
%H A334403 Robert Israel, <a href="/A334403/b334403.txt">Table of n, a(n) for n = 1..10000</a>
%e A334403 198/18 = 11.
%p A334403 filter:= n -> convert(convert(n,base,10),`+`) = 18:
%p A334403 select(filter, [seq(i,i=18...4000, 18)]); # _Robert Israel_, Mar 26 2023
%t A334403 Select[18 * Range[100], Plus @@ IntegerDigits[#] == 18 &] (* _Amiram Eldar_, Sep 08 2020 *)
%o A334403 (PARI) isok(m) = my(s=sumdigits(m)); (s==18) && !(m%s); \\ _Michel Marcus_, Sep 08 2020
%o A334403 (PARI) first(n) = {my(res = vector(n), t = 0); forstep(i = 18, oo, 18, if(vecsum(digits(i)) == 18, t++; res[t] = i; if(t >= n, return(res) ) ) ) } \\ _David A. Corneth_, Sep 08 2020
%Y A334403 Intersection of A005349 and A235228.
%Y A334403 Subsequence of A008600.
%Y A334403 Cf. A002998.
%K A334403 nonn,easy,base
%O A334403 1,1
%A A334403 _Davide Rotondo_, Sep 08 2020
%E A334403 More terms from _Michel Marcus_, Sep 08 2020