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 A161351 #25 Nov 21 2022 01:26:48
%S A161351 3,6,9,12,15,18,21,24,27,11,14,17,20,23,26,29,32,35,38,22,26,30,34,38,
%T A161351 42,46,50,54,58,33,38,43,48,53,58,63,68,73,78,44,50,56,62,68,74,80,86,
%U A161351 92,98,55,62,69,76,83,90,97,104,111,118,66,74,82,90,98,106,114,122,130
%N A161351 a(n) = n + sum_of_digits(n) + product_of_digits(n).
%C A161351 a(10) = 10 + (1 + 0) + (1*0) = 11 ; a(19) = 19 + (9 + 1) + (9*1) = 38.
%H A161351 Harvey P. Dale, <a href="/A161351/b161351.txt">Table of n, a(n) for n = 1..1000</a>
%F A161351 a(n) = n + A007953(n) + A007954(n). - _Michel Marcus_, Nov 12 2022
%F A161351 If n contains a digit 0 (A011540), then a(n) = A062028(n). - _Bernard Schott_, Nov 12 2022
%t A161351 Table[n+Total[IntegerDigits[n]]+Times@@IntegerDigits[n],{n,70}] (* _Harvey P. Dale_, Jun 07 2020 *)
%o A161351 (PARI) a(n) = my(d=digits(n)); n + vecsum(d) + vecprod(d); \\ _Michel Marcus_, Nov 12 2022
%o A161351 (Python)
%o A161351 from math import prod
%o A161351 def a(n): d = list(map(int, str(n))); return n + sum(d) + prod(d)
%o A161351 print([a(n) for n in range(1, 71)]) # _Michael S. Branicky_, Nov 20 2022
%Y A161351 Cf. A007953, A007954, A011540, A062028.
%K A161351 nonn,base
%O A161351 1,1
%A A161351 _Claudio Meller_, Jun 07 2009