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 A335130 #53 Jul 28 2020 08:46:46
%S A335130 2,3,4,5,6,5,7,7,10,7,11,10,11,10,11,11,14,13,14,13,13,11,15,12,17,13,
%T A335130 17,13,19,13,14,15,15,15,17,17,17,19,19,17,19,17,18,17,17,18,21,19,22,
%U A335130 21,21,19,21,21,23,23,19,19,26,19,19,23,23,23,29,21,22,21,23,21,23,22,23,23,28,23,31,23,26,25
%N A335130 a(n) = 1 + Sum_{k=1..n} sign((sign(n+Sum_{j=2..k}-|A334312(n,j)|)+1)).
%C A335130 a(n) appears to be asymptotic to sqrt(8*n).
%H A335130 Mats Granvik, <a href="/A335130/b335130.txt">Table of n, a(n) for n = 1..10000</a>
%H A335130 Mats Granvik, <a href="/A335130/a335130_2.txt">More efficient Mathematica program for the sequence</a>
%H A335130 Mats Granvik, <a href="/A335130/a335130_1.png">Plot of 10000 first terms together with conjectured asymptotic</a>
%H A335130 Mats Granvik, <a href="https://mathoverflow.net/q/359060/25104">What is the asymptotic of the irregular blue curve? Is it (8x)^(1/2) or is it something else?</a>, MathOverflow, May 24 2020.
%F A335130 a(n) = 1 + Sum_{k=1..n} sign((sign(n+Sum_{j=2..k}-|A334312(n,j)|)+1)).
%t A335130 nn = 80; varphi[n_] := DivisorSum[n, MoebiusMu[#] # &]; A = Table[Table[Sum[If[n >= k, varphi[GCD[i, k]], 0], {i, k, n}], {k, 1, nn}], {n, 1, nn}]; vv = Table[1 + Sum[Sign[(1 + Sign[Sum[If[j == 1, A[[n, j]], -Abs[A[[n, j]]]], {j, 1, k}]])], {k, 1, n}], {n, 1, nn}]
%Y A335130 Cf. A334312.
%K A335130 nonn
%O A335130 1,1
%A A335130 _Mats Granvik_, May 24 2020