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 A049829 #21 Sep 16 2022 07:34:45
%S A049829 0,0,1,1,5,3,10,12,14,16,33,21,41,45,46,50,74,72,99,83,97,111,158,120,
%T A049829 148,176,181,185,243,191,262,254,282,314,313,293,363,391,418,386,480,
%U A049829 414,529,497,501,573,660,570,626,672,699,703
%N A049829 a(n) = Sum_{k=1..n} T(n,k), array T as in A049828.
%H A049829 Robert Israel, <a href="/A049829/b049829.txt">Table of n, a(n) for n = 1..10000</a>
%p A049829 T:= proc(n,k) option remember;
%p A049829 if n*k = 0 then 0 else (n mod k) + procname(k,n mod k) fi
%p A049829 end proc:
%p A049829 seq(add(T(n,k),k=1..n), n=1..100); # _Robert Israel_, Aug 31 2015
%t A049829 T[n_, k_] := T[n, k] = If[n*k == 0, 0, Mod[n, k] + T[k, Mod[n, k]]];
%t A049829 a[n_] := Sum[T[n, k], {k, 1, n}];
%t A049829 Table[a[n], {n, 1, 100}] (* _Jean-François Alcover_, Sep 16 2022, after _Robert Israel_ *)
%o A049829 (PARI) t(n, k) = {x = n; y = k; r = 1; s = 0; while (r, q = x\y; r = x - y*q; s +=r; x = y; y = r;); s;}
%o A049829 a(n) = sum(k=1, n, t(n, k)); \\ _Michel Marcus_, Aug 31 2015
%Y A049829 Cf. A049828.
%K A049829 nonn
%O A049829 1,5
%A A049829 _Clark Kimberling_