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 A049831 #15 Aug 08 2021 01:17:03
%S A049831 0,0,1,1,3,2,4,6,5,6,8,8,11,10,9,12,12,15,15,14,19,16,19,18,19,22,21,
%T A049831 23,26,25,27,24,27,32,27,30,33,31,33,30,35,38,35,38,40,38,44,39,44,46,
%U A049831 43,44,47,45,53,46,49,52,50,56,54,54,57,56
%N A049831 a(n) = Max_{k=1..n} T(n,k), array T as in A049828.
%C A049831 a(n)/n -> 1, while n goes to infinity (for proof see attached link). - _Tiberiu Szocs-Mihai_, Aug 17 2015
%H A049831 Tiberiu Szocs-Mihai, <a href="http://mathticks.blogspot.ro/2011/01/discrete-connections-part-iv.html">Euclidean summation functions</a>, Math Ticks Blog, January 2011.
%o A049831 (PARI) a(nn) = {for (n=1, nn, m = 0; for (k=1, n, a = n; b = k; r = 1; s = 0; while (r, q = a\b; r = a - b*q; s += r; a = b; b = r); m = max(m, s);); print1(m, ", "););} \\ _Michel Marcus_, Aug 18 2015
%Y A049831 Cf. A049828.
%K A049831 nonn
%O A049831 1,5
%A A049831 _Clark Kimberling_