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 A160943 #17 Mar 11 2021 17:30:11
%S A160943 3,6,9,12,15,18,21,24,18,21,15,18,21,24,27,30,33,36,30,33,27,30,33,36,
%T A160943 39,42,45,48,42,45,39,42,45,48,51,54,57,60,54,57,51,54,57,60,63,66,69,
%U A160943 72,66,69,63,66,69,72,75,78,81,84,78,81,75,78,81,84,87,90,93,96,90,93
%N A160943 a(n) = n + digital sum(n-1) + digital sum(n+1).
%F A160943 a(n) = n + A007953(n-1) + A007953(n+1)
%e A160943 a(8) = 8 +ds(7) +ds(9) = 7+8+9 = 24;
%e A160943 a(15) = 15+ds(14)+ds(16) = 15+5+7 = 27;
%e A160943 a(26) = 26+ds(25)+ds(27) = 26+7+9 = 42.
%t A160943 Table[n+Total[IntegerDigits[n-1]]+Total[IntegerDigits[n+1]],{n,70}] (* _Harvey P. Dale_, Jun 24 2011 *)
%o A160943 (Python)
%o A160943 def A160943(n): return n+sum(int(d) for d in str(n-1))+sum(int(d) for d in str(n+1)) # _Chai Wah Wu_, Mar 11 2021
%o A160943 (PARI) a(n) = n + sumdigits(n-1) + sumdigits(n+1); \\ _Michel Marcus_, Mar 11 2021
%Y A160943 Cf. A007953, A062028, A160939.
%K A160943 nonn,base
%O A160943 1,1
%A A160943 _Claudio Meller_, May 30 2009