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 A269333 #16 Jul 26 2022 01:36:23 %S A269333 2,2,2,2,3,3,4,6,11,29,6,8,6,7,33,18,17,111,21,249,38,44,39,162,239, %T A269333 153,737,246,231,2333,258,309,303,882,1971,8333,2027,1842,2051,19997, %U A269333 2439,7119,2093,13409,111111,13043,10617,20831,18161,399999,72549,55769,56583 %N A269333 Smallest number such that the sum of the digits of n * a(n) is greater than n. %F A269333 a(n) = A269332(n) / n. %o A269333 (PARI) a(n) = my(m=2*n); while (sumdigits(m) <= n, m+=n); m/n; \\ _Michel Marcus_, Feb 24 2016 %o A269333 (Python) %o A269333 from itertools import count %o A269333 def A269333(n): return next(k for k in count(2) if sum(map(int,str(k*n)))>n) # _Chai Wah Wu_, Jul 25 2022 %Y A269333 Cf. A269332. %K A269333 nonn,base %O A269333 1,1 %A A269333 _Franklin T. Adams-Watters_, Feb 24 2016 %E A269333 More terms from _Michel Marcus_, Feb 24 2016