The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A045844 a(n+1) = a(n) + largest digit of a(n); a(0) = 1. 8
 1, 2, 4, 8, 16, 22, 24, 28, 36, 42, 46, 52, 57, 64, 70, 77, 84, 92, 101, 102, 104, 108, 116, 122, 124, 128, 136, 142, 146, 152, 157, 164, 170, 177, 184, 192, 201, 203, 206, 212, 214, 218, 226, 232, 235, 240, 244, 248, 256, 262, 268, 276, 283, 291, 300, 303, 306 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n+1) = A095815(a(n)). [Reinhard Zumkeller, Aug 23 2011] LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 FORMULA a(0) = 1; a(n) = a(n-1) + MaxDigit(a(n-1)) for n > 0 where MaxDigit(x) is the largest digit in decimal notation for an integer x. EXAMPLE a(17) = 92; a(18) = 92 + 9 = 101; a(19) = 101 + 1 = 102; a(20) = 102 + 2 = 104 MATHEMATICA NestList[#+Max[IntegerDigits[#]]&, 1, 60] (* Harvey P. Dale, Oct 25 2011 *) PROG (Haskell) a045844 n = a045844_list !! n a045844_list = iterate a095815 1 -- Reinhard Zumkeller, Aug 23 2011 (PARI) print1(a=1); for(i=1, 99, print1(", "a+=vecmax(digits(a)))) \\ - M. F. Hasler, Jan 14 2014 CROSSREFS Cf. A095815, A061681. Sequence in context: A328265 A002081 A102039 * A254062 A230102 A063108 Adjacent sequences:  A045841 A045842 A045843 * A045845 A045846 A045847 KEYWORD base,easy,nonn,nice AUTHOR STATUS approved

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

Last modified May 26 13:49 EDT 2020. Contains 334626 sequences. (Running on oeis4.)