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!)
A169734 a(1) = 1000; for n>1, a(n) = a(n-1) + digitsum(a(n-1)). 1
1000, 1001, 1003, 1007, 1015, 1022, 1027, 1037, 1048, 1061, 1069, 1085, 1099, 1118, 1129, 1142, 1150, 1157, 1171, 1181, 1192, 1205, 1213, 1220, 1225, 1235, 1246, 1259, 1276, 1292, 1306, 1316, 1327, 1340, 1348, 1364, 1378, 1397, 1417, 1430, 1438, 1454 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MAPLE
f:=proc(n) global S; option remember; if n=1 then RETURN(S) else RETURN(f(n-1)+digsum(f(n-1))); fi; end; S:=1000; [seq(f(n), n=1..120)];
CROSSREFS
First differences are A065075. Cf. A169732.
Sequence in context: A033421 A033432 A169732 * A213317 A281150 A069746
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, May 01 2010
STATUS
approved

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 May 7 13:58 EDT 2024. Contains 372310 sequences. (Running on oeis4.)