login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A016052 a(1) = 3; for n >= 1, a(n+1) = a(n) + sum of its digits. 14
3, 6, 12, 15, 21, 24, 30, 33, 39, 51, 57, 69, 84, 96, 111, 114, 120, 123, 129, 141, 147, 159, 174, 186, 201, 204, 210, 213, 219, 231, 237, 249, 264, 276, 291, 303, 309, 321, 327, 339, 354, 366, 381, 393, 408, 420, 426, 438, 453, 465, 480, 492 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

REFERENCES

A Result and a Conjecture on Digit Sum Sequences, G. E. Stevens and L. G. Hunsberger, J. Recreational Math. 27, no. 4 (1995), pp. 285-288.

MAPLE

P:=proc(n) local a, i, k, w; a:=3; print(a); for i from 1 by 1 to n do w:=0; k:=a; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; a:=a+w; print(a); od; end: P(1000); - Paolo P. Lava (paoloplava(AT)gmail.com), May 02 2007

CROSSREFS

Cf. A004207.

Sequence in context: A016051 A070790 A114614 * A115803 A032602 A116593

Adjacent sequences:  A016049 A016050 A016051 * A016053 A016054 A016055

KEYWORD

nonn,base,easy

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 14:02 EST 2012. Contains 205811 sequences.