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 A160939 #22 Aug 09 2025 10:05:36
%S A160939 1,3,5,7,9,11,13,15,17,19,12,14,16,18,20,22,24,26,28,30,23,25,27,29,
%T A160939 31,33,35,37,39,41,34,36,38,40,42,44,46,48,50,52,45,47,49,51,53,55,57,
%U A160939 59,61,63,56,58,60,62,64,66,68,70,72,74,67,69,71,73,75,77,79,81,83,85,78
%N A160939 a(n) = n + digital sum (n-1).
%H A160939 Vincenzo Librandi, <a href="/A160939/b160939.txt">Table of n, a(n) for n = 1..5000</a>
%F A160939 a(n+1) = A062028(n) + 1 for n >= 1. - _Michel Marcus_, Aug 02 2018
%e A160939 Writing ds() for the sum of digits (A007953),
%e A160939 a(8) = 8 + ds(7) = 8 + 7 = 15,
%e A160939 a(15) = 15 + ds(14) = 15 + 5 = 20,
%e A160939 a(26) = 26 + ds(25) = 26 + 7 = 33.
%t A160939 Table[n+Total[IntegerDigits[n-1]],{n,80}] (* _Harvey P. Dale_, Dec 08 2012 *)
%o A160939 (PARI) a(n) = n + sumdigits(n-1); \\ _Michel Marcus_, Aug 02 2018
%o A160939 (Magma) [n + &+Intseq(n-1): n in [1..80]]; // _Vincenzo Librandi_, Nov 09 2018
%o A160939 (Python)
%o A160939 def A160939(n): return n+sum(map(int,str(n-1))) # _Chai Wah Wu_, Aug 09 2025
%Y A160939 Cf. A007953, A062028.
%K A160939 nonn,base
%O A160939 1,2
%A A160939 _Claudio Meller_, May 30 2009