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!)
 A259043 a(n) = if n < 10 then n else a(floor(n/10) + n mod 10) + n mod 10. 2
 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 3, 5, 7, 9, 11, 13, 15, 17, 10, 2, 4, 6, 8, 10, 12, 14, 16, 9, 12, 3, 5, 7, 9, 11, 13, 15, 8, 11, 14, 4, 6, 8, 10, 12, 14, 7, 10, 13, 16, 5, 7, 9, 11, 13, 6, 9, 12, 15, 18, 6, 8, 10, 12, 5, 8, 11, 14, 17, 20, 7, 9, 11, 4, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(A259046(n)) = n and a(m) != n for m < A259046(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 PROG (Haskell) a259043 x = if x < 10 then x else a259043 (x' + d) + d             where (x', d) = divMod x 10 CROSSREFS Cf. A076314, A007953, A008687, A259046. Sequence in context: A115026 A101337 A135208 * A156207 A061486 A264600 Adjacent sequences:  A259040 A259041 A259042 * A259044 A259045 A259046 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Jun 17 2015 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 February 27 08:51 EST 2020. Contains 332301 sequences. (Running on oeis4.)