A045776 a(n+1) is smallest multiple of (sum of digits of a(n)) which is > a(n).

1, 2, 4, 8, 16, 21, 24, 30, 33, 36, 45, 54, 63, 72, 81, 90, 99, 108, 117, 126, 135, 144, 153, 162, 171, 180, 189, 198, 216, 225, 234, 243, 252, 261, 270, 279, 288, 306, 315, 324, 333, 342, 351, 360, 369, 378, 396, 414, 423, 432, 441, 450

Offset

0,2

Comments

a(n) mod 9 = 0 for n > 8. [Reinhard Zumkeller, Dec 28 2011]

Links

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Mathematica

nxt[n_]:=Module[{sd=Total[IntegerDigits[n]]}, (Floor[n/sd]+1)sd]; NestList[nxt, 1, 60] (* Harvey P. Dale, Jul 28 2012 *)

Prog

(Haskell)
a045776 n = a045776_list !! n
a045776_list = iterate f 1 where
   f x = head $ dropWhile (<= x) [q, 2*q..] where q = a007953 x
-- Reinhard Zumkeller, Dec 28 2011

Crossrefs

Cf. A007953.

Sequence in context: A134162 A244484 A350414 * A102252 A174838 A308149

Adjacent sequences: A045773 A045774 A045775 * A045777 A045778 A045779

Keyword

easy,nonn,base,nice

Author

Erich Friedman

Status

approved