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 A196118 #22 Dec 26 2020 08:42:40
%S A196118 0,1,2,3,5,8,14,26,51,103,216,463,1011,2237,5007,11306,25732,58941,
%T A196118 135792,314410,731258,1707554,4001778,9409162,22189556,52472676,
%U A196118 124397323,295594279,703904947,1679567427,4015010504,9614519152,23060649590,55395487476
%N A196118 Partial sums of A004111.
%C A196118 A004111 is an important sequence and the OEIS should include various sequences derived from it.
%H A196118 Alois P. Heinz, <a href="/A196118/b196118.txt">Table of n, a(n) for n = 0..1000</a>
%F A196118 a(n) ~ c * A246169^n / n^(3/2), where c = 0.601433809400132103408618319570970615307211984303335915895942080355184647... - _Vaclav Kotesovec_, Dec 26 2020
%p A196118 with(numtheory):
%p A196118 b:= proc(n) option remember; `if`(n<2, n, add(b(n-k)*add(
%p A196118 b(d)*d*(-1)^(k/d+1), d=divisors(k)), k=1..n-1)/(n-1))
%p A196118 end:
%p A196118 a:= proc(n) option remember; b(n)+`if`(n>0, a(n-1), 0) end:
%p A196118 seq(a(n), n=0..50); # _Alois P. Heinz_, Feb 24 2015
%t A196118 b[n_] := b[n] = If[n<2, n, Sum[b[n-k]*Sum[b[d]*d*(-1)^(k/d+1), {d, Divisors[k]}], {k, 1, n-1}]/(n-1)]; a[n_] := a[n] = b[n] + If[n>0, a[n-1], 0]; Table[a[n], {n, 0, 50}] (* _Jean-François Alcover_, Feb 17 2016, after _Alois P. Heinz_ *)
%Y A196118 Cf. A004111, A196154, A196161.
%K A196118 nonn
%O A196118 0,3
%A A196118 _N. J. A. Sloane_, Oct 27 2011