login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A095815
a(n) = n + largest digit of n.
4
2, 4, 6, 8, 10, 12, 14, 16, 18, 11, 12, 14, 16, 18, 20, 22, 24, 26, 28, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 33, 34, 35, 36, 38, 40, 42, 44, 46, 48, 44, 45, 46, 47, 48, 50, 52, 54, 56, 58, 55, 56, 57, 58, 59, 60, 62, 64, 66, 68, 66, 67, 68, 69, 70, 71, 72, 74, 76, 78, 77, 78
OFFSET
1,1
LINKS
EXAMPLE
a(19) = 19 + 9 = 28.
a(77) = 77 + 7 = 84.
MATHEMATICA
#+Max[IntegerDigits[#]]&/@Range[100] (* Harvey P. Dale, May 03 2024 *)
PROG
(Haskell)
a095815 n = n + fromIntegral (a054055 n) -- Reinhard Zumkeller, Aug 23 2011
(Python)
def A095815(n): return n + max(int(d) for d in str(n)) # Chai Wah Wu, Jun 06 2022
CROSSREFS
Cf. A054055; A045844 (iterated).
Cf. A182324.
Sequence in context: A230099 A098727 A182324 * A063114 A064806 A062028
KEYWORD
base,easy,nonn
AUTHOR
Jason Earls, Jul 10 2004
STATUS
approved