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 A095815 #19 May 03 2024 18:55:19 %S A095815 2,4,6,8,10,12,14,16,18,11,12,14,16,18,20,22,24,26,28,22,23,24,26,28, %T A095815 30,32,34,36,38,33,34,35,36,38,40,42,44,46,48,44,45,46,47,48,50,52,54, %U A095815 56,58,55,56,57,58,59,60,62,64,66,68,66,67,68,69,70,71,72,74,76,78,77,78 %N A095815 a(n) = n + largest digit of n. %H A095815 Reinhard Zumkeller, <a href="/A095815/b095815.txt">Table of n, a(n) for n = 1..10000</a> %e A095815 a(19) = 19 + 9 = 28. %e A095815 a(77) = 77 + 7 = 84. %t A095815 #+Max[IntegerDigits[#]]&/@Range[100] (* _Harvey P. Dale_, May 03 2024 *) %o A095815 (Haskell) %o A095815 a095815 n = n + fromIntegral (a054055 n) -- _Reinhard Zumkeller_, Aug 23 2011 %o A095815 (Python) %o A095815 def A095815(n): return n + max(int(d) for d in str(n)) # _Chai Wah Wu_, Jun 06 2022 %Y A095815 Cf. A054055; A045844 (iterated). %Y A095815 Cf. A182324. %K A095815 base,easy,nonn %O A095815 1,1 %A A095815 _Jason Earls_, Jul 10 2004