This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A219675 Starting with a(0)=0, a(n) = 1 + the sum of the digital sums of a(0) through a(n-1). 4
 0, 1, 2, 4, 8, 16, 23, 28, 38, 49, 62, 70, 77, 91, 101, 103, 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 0,3 COMMENTS Almost identical to A004207, only difference being a(0). - Yuval Filmus, Apr 22 2016. LINKS Eric Angelini, a(n) > cumulative sum of digits, Seqfan, Nov. 11, 2014. FORMULA a(n) = Sum_{k=0..n-1} digsum(a(k)) + 1. a(n) = a(n-1) + digsum(a(n-1)). EXAMPLE a(7) = 28 because (0+1+2+4+8+1+6+2+3) + 1 = 28. MATHEMATICA a219675[n_Integer] := Module[{f}, f[0] = 0; f[k_] := 1 + Sum[Plus @@ IntegerDigits[f[i]], {i, 0, k - 1}]; f[n]]; a219675/@Range[40] (* Michael De Vlieger, Nov 17 2014 *) PROG (PARI) lista(nn) = {v = vector(nn); for (n=2, nn, v[n] = 1 + sum(k=1, n-1, sumdigits(v[k])); ); v; } \\ Michel Marcus, Nov 17 2014 CROSSREFS Cf. A004207, A007953, A244510 (related). Sequence in context: A007612 A112395 A004207 * A062729 A004620 A018618 Adjacent sequences:  A219672 A219673 A219674 * A219676 A219677 A219678 KEYWORD nonn,base,easy AUTHOR Bob Selcoe, Nov 17 2014 EXTENSIONS More terms from Michel Marcus, Nov 17 2014 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 December 6 04:43 EST 2019. Contains 329784 sequences. (Running on oeis4.)