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 A178063 #18 Jul 25 2020 10:39:10
%S A178063 1,2,4,7,11,17,23,34,44,62,78,98,122,148,168,213,253,291,325,387,433,
%T A178063 487,537,621,671,773,851,955,1053,1143,1213,1402,1484,1614,1698,1818,
%U A178063 1930,2060,2180,2412,2564,2798,2930,3060,3268,3550,3690,4152,4332,4542
%N A178063 Partial sums of A007464.
%H A178063 Reinhard Zumkeller, <a href="/A178063/b178063.txt">Table of n, a(n) for n = 0..10000</a>
%F A178063 a(n) = Sum_{i=0..n} A007464(i).
%p A178063 a007464:= proc(n) option remember;
%p A178063 `if`(n=0, 1, add(igcd(procname(i), procname(n-1-i)), i=0..n-1))
%p A178063 end proc:
%p A178063 ListTools[PartialSums](map(a007464,[$0..100])); # _Robert Israel_, Mar 22 2015
%t A178063 (* b is A007464 *) b[0] = 1; b[1] = 1; b[n_] := b[n] = Sum[GCD[b[k], b[n - k - 1]], {k, 0, n - 1}];
%t A178063 b /@ Range[0, 100] // Accumulate (* _Jean-François Alcover_, Jul 25 2020 *)
%o A178063 (Haskell)
%o A178063 a178063 n = a178063_list !! n
%o A178063 a178063_list = scanl1 (+) a007464_list
%o A178063 -- _Reinhard Zumkeller_, Jan 21 2014
%Y A178063 Cf. A007464.
%K A178063 nonn,easy
%O A178063 0,2
%A A178063 _Jonathan Vos Post_, May 18 2010
%E A178063 a(45) fixed by _Reinhard Zumkeller_, Jan 21 2014