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 A115299 #10 Dec 12 2023 16:29:55 %S A115299 2,4,6,8,10,12,14,16,18,1,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,11,3, %T A115299 4,5,6,7,8,9,10,11,12,4,5,6,7,8,9,10,11,12,13,5,6,7,8,9,10,11,12,13, %U A115299 14,6,7,8,9,10,11,12,13,14,15,7,8,9,10,11,12,13,14,15,16,8,9,10,11,12,13,14 %N A115299 Greatest digit of n + least digit of n. Different from A088133. %C A115299 a(101) = 1 and A088133(101) = 2, but all previous terms match. %H A115299 Michael S. Branicky, <a href="/A115299/b115299.txt">Table of n, a(n) for n = 1..10000</a> %e A115299 a(1) = 1 + 1 = 2, a(232) = 3 + 2 = 5, a(1889009898) = 9 + 0 = 9. %t A115299 Array[Max[#] + Min[#] &@ IntegerDigits[#] &, 120] (* _Michael De Vlieger_, Dec 12 2023 *) %o A115299 (Python) %o A115299 def a(n): d = list(map(int, str(n))); return max(d) + min(d) %o A115299 print([a(n) for n in range(1, 87)]) # _Michael S. Branicky_, Dec 12 2023 %Y A115299 Cf. A037904 (greatest-least), A115300 (greatest*least), A088133 (first+last). %K A115299 base,nonn %O A115299 1,1 %A A115299 _Rick L. Shepherd_, Jan 20 2006