This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A247084 #29 Dec 23 2024 14:53:43
%S A247084 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,
%T A247084 118,135,153,160,170,179,188,195,203,220,237,252,257,261,273,282,296,
%U A247084 305,317,329,346,354,365,379,392,404,418,437,451,459,472,486,496,514
%N 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).
%H A247084 Eric Angelini, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2014-November/013951.html">a(n) > cumulative sum of digits</a>, Seqfan, Nov. 11, 2014.
%F A247084 a(n) = 1 + Sum_{k=0..n-4} digsum(a(k)).
%F A247084 a(n) = a(n-1) + digsum(a(n-4)).
%e A247084 a(15) = 32 because (0+1+1+1+1+2+3+4+5+7+1+0+1+4) + 1 = 32.
%t A247084 a247084[n_Integer] := Module[{t = Table[1, {i, n + 1}], j, k},
%t A247084 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 *)
%o A247084 (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
%Y A247084 Cf. A007953, A219675, A244510 (related).
%K A247084 base,nonn
%O A247084 0,6
%A A247084 _Bob Selcoe_, Nov 17 2014
%E A247084 More terms from _Michel Marcus_, Nov 18 2014