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!)
 A219675 Starting with a(0)=0, a(n) = 1 + the sum of the digital sums of a(0) through a(n-1). 4

%I

%S 0,1,2,4,8,16,23,28,38,49,62,70,77,91,101,103,107,115,122,127,137,148,

%T 161,169,185,199,218,229,242,250,257,271,281,292,305,313,320,325,335,

%U 346,359,376,392,406,416,427,440,448,464,478,497,517,530,538,554,568

%N Starting with a(0)=0, a(n) = 1 + the sum of the digital sums of a(0) through a(n-1).

%C Almost identical to A004207, only difference being a(0). - _Yuval Filmus_, Apr 22 2016.

%H Eric Angelini, <a href="http://list.seqfan.eu/pipermail/seqfan/2014-November/013951.html">a(n) > cumulative sum of digits</a>, Seqfan, Nov. 11, 2014.

%F a(n) = Sum_{k=0..n-1} digsum(a(k)) + 1.

%F a(n) = a(n-1) + digsum(a(n-1)).

%e a(7) = 28 because (0+1+2+4+8+1+6+2+3) + 1 = 28.

%t 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 *)

%o (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

%Y Cf. A004207, A007953, A244510 (related).

%K nonn,base,easy

%O 0,3

%A _Bob Selcoe_, Nov 17 2014

%E More terms from _Michel Marcus_, Nov 17 2014

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 January 24 07:18 EST 2020. Contains 331189 sequences. (Running on oeis4.)