login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A219675
Starting with a(0)=0, a(n) = 1 + the sum of the digital sums of a(0) through a(n-1).
5
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
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
(PARI) A219675_upto(n)=vector(n, i, n=if(i<3, i-1, n+sumdigits(n))) \\ M. F. Hasler, Oct 30 2024
CROSSREFS
Cf. A004207 (essentially the same), A007953 (sum of digits), A244510 (related).
Sequence in context: A007612 A112395 A004207 * A062729 A004620 A018618
KEYWORD
nonn,base,easy,changed
AUTHOR
Bob Selcoe, Nov 17 2014
EXTENSIONS
More terms from Michel Marcus, Nov 17 2014
STATUS
approved