This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006507 a(n+1) = a(n) + sum of digits of a(n), with a(1)=7. (Formerly M4348) 19
 7, 14, 19, 29, 40, 44, 52, 59, 73, 83, 94, 107, 115, 122, 127, 137, 148, 161, 169, 185, 199, 218, 229, 242, 250, 257, 271, 281, 292, 305, 313, 320, 325, 335, 346, 359, 376, 392, 406, 416, 427, 440, 448, 464, 478, 497, 517, 530, 538, 554, 568 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) = A004207(n+4) for n > 11. - Reinhard Zumkeller, Oct 14 2013 REFERENCES Editorial Note, Popular Computing (Calabasas, CA), Vol. 4 (No. 37, Apr 1976), p. 12. D. R. Kaprekar, Puzzles of the Self-Numbers. 311 Devlali Camp, Devlali, India, 1959. D. R. Kaprekar, The Mathematics of the New Self Numbers, Privately Printed, 311 Devlali Camp, Devlali, India, 1963. Jeffrey Shallit, personal communication. N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 D. R. Kaprekar, The Mathematics of the New Self Numbers [annotated and scanned] FORMULA a(n) = A062028(a(n-1)) for n > 1. - Reinhard Zumkeller, Oct 14 2013 PROG (Haskell) a006507 n = a006507_list !! (n-1) a006507_list = iterate a062028 7  -- Reinhard Zumkeller, Oct 14 2013 CROSSREFS Cf. A016052, A007618, A016096. Sequence in context: A232488 A070792 A178893 * A257584 A035404 A003863 Adjacent sequences:  A006504 A006505 A006506 * A006508 A006509 A006510 KEYWORD base,nonn AUTHOR EXTENSIONS More terms from Robert G. Wilson v 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 September 20 12:41 EDT 2019. Contains 327237 sequences. (Running on oeis4.)