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”).

A247084
a(n)=0 when n<=0: Starting with n=1, a(n) = 1 + the sum of the digital sums of a(0) through a(n-4).
1
0, 1, 1, 1, 1, 2, 3, 4, 5, 7, 10, 14, 19, 26, 27, 32, 42, 50, 59, 64, 70, 75, 89, 99, 106, 118, 135, 153, 160, 170, 179, 188, 195, 203, 220, 237, 252, 257, 261, 273, 282, 296, 305, 317, 329, 346, 354, 365, 379, 392, 404, 418, 437, 451, 459, 472, 486, 496, 514
OFFSET
0,6
LINKS
Eric Angelini, a(n) > cumulative sum of digits, Seqfan, Nov. 11, 2014.
FORMULA
a(n) = 1 + Sum_{k=0..n-4} digsum(a(k)).
a(n) = a(n-1) + digsum(a(n-4)).
EXAMPLE
a(15) = 32 because (0+1+1+1+1+2+3+4+5+7+1+0+1+4) + 1 = 32.
MATHEMATICA
a247084[n_Integer] := Module[{t = Table[1, {i, n + 1}], j, k},
t[[1]] = 0; j = 6; While[j <= Length[t], t[[j]] = Sum[Plus @@ IntegerDigits[t[[k]]], {k, 1, j - 4}]; ++]; Drop[t, {2}]]; a247084[59] (* Michael De Vlieger, Nov 29 2014 *)
PROG
(PARI) lista(nn) = {v = vector(nn); for (n=2, nn, v[n] = 1 + sum(i=1, n-4, if (n-4 > 0, sumdigits(v[i]))); ); v; } \\ Michel Marcus, Nov 18 2014
CROSSREFS
Cf. A007953, A219675, A244510 (related).
Sequence in context: A321481 A238874 A099559 * A017898 A003269 A367794
KEYWORD
base,nonn
AUTHOR
Bob Selcoe, Nov 17 2014
EXTENSIONS
More terms from Michel Marcus, Nov 18 2014
STATUS
approved