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!)
 A102718 a(n) = a(n-1) + (sum of the last two digits of the sequence so far); a(0)=0; a(1)=1. 1
 0, 1, 2, 5, 12, 15, 21, 24, 30, 33, 39, 51, 57, 69, 84, 96, 111, 113, 117, 125, 132, 137, 147, 158, 171, 179, 195, 209, 218, 227, 236, 245, 254, 263, 272, 281, 290, 299, 317, 325, 332, 337, 347, 358, 371, 379, 395, 409, 418, 427, 436, 445, 454, 463, 472, 481, 490, 499, 517, 525, 532, 537, 547, 558, 571 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Harvey P. Dale, Table of n, a(n) for n = 0..1000 FORMULA a(n + 20) = 200 + a(n) for n > 17. - David A. Corneth, May 11 2018 EXAMPLE 96 + (9 + 6) = 111; 111 + (1 + 1) = 113; 113 + (1 + 3) = 117. MATHEMATICA Join[{0, 1, 2, 5}, NestList[#+Total[Take[IntegerDigits[#], -2]]&, 12, 60]] (* Harvey P. Dale, May 11 2018 *) PROG (PARI) first(n) = {n = max(n, 5); res = [0, 1, 2, 5, 12]; res = concat(res, vector(n - 5)); for(i = 6, min(n, 37), res[i] = res[i-1] + vecsum(digits(res[i-1] % 100))); for(i = 38, n, res[i] = res[i - 20] + 200); res} \\ David A. Corneth, May 11 2018 CROSSREFS Cf. A102039. Sequence in context: A215974 A192524 A287553 * A219954 A066267 A084122 Adjacent sequences:  A102715 A102716 A102717 * A102719 A102720 A102721 KEYWORD base,easy,nonn AUTHOR Eric Angelini, Feb 06 2005 EXTENSIONS Corrected and extended by Harvey P. Dale, May 11 2018 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 17 17:57 EDT 2021. Contains 347489 sequences. (Running on oeis4.)