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 A327617 #17 Nov 07 2019 13:39:15
%S A327617 0,2,6,8,3,5,9,2,6,8,3,32,9,2,6,35,3,5,9,20,6,17,66,14,9,11,6,8,3,14,
%T A327617 9,2,15,17,3,5,63,11,6,8,3,23,18,11,33,8,3,5,27,2,6,8,3,50,18,2,6,35,
%U A327617 3,5,18,2,6,44,3,41,90,2,6,35,3,32,90,2,186,62,3,32,9,20,6
%N A327617 a(n) is the least integer k such that digit_sum(A007494(n)*k) = digit_sum(A007494(n)+k).
%C A327617 It appears that most terms are less than 100.
%o A327617 (PARI) lista(nn) = {for (n=0, nn, if ((n%3) != 1, my(k=0); while(sumdigits(n+k) != sumdigits(n*k), k++); print1(k, ", ");););} \\ _Michel Marcus_, Sep 19 2019
%Y A327617 Cf. A007494, A007953 (sum of digits).
%K A327617 nonn,base
%O A327617 1,2
%A A327617 _Max Lacoma_, Sep 19 2019