login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095815 n + largest digit of n. 4

%I #14 Jun 06 2022 15:54:55

%S 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 30,32,34,36,38,33,34,35,36,38,40,42,44,46,48,44,45,46,47,48,50,52,54,

%U 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 n + largest digit of n.

%H Reinhard Zumkeller, <a href="/A095815/b095815.txt">Table of n, a(n) for n = 1..10000</a>

%e a(19) = 19 + 9 = 28. a(77) = 77 + 7 = 84.

%o (Haskell)

%o a095815 n = n + fromIntegral (a054055 n) -- _Reinhard Zumkeller_, Aug 23 2011

%o (Python)

%o def A095815(n): return n + max(int(d) for d in str(n)) # _Chai Wah Wu_, Jun 06 2022

%Y Cf. A054055; A045844 (iterated).

%Y Cf. A182324.

%K base,easy,nonn

%O 1,1

%A _Jason Earls_, Jul 10 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)