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 A364933 #9 Sep 13 2023 23:11:54
%S A364933 0,-1,-1,0,-1,-2,-1,2,3,-2,-1,0,-1,-2,1,6,-1,2,-1,2,3,-2,-1,4,15,-2,
%T A364933 15,4,-1,0,-1,14,7,-2,13,8,-1,-2,9,10,-1,2,-1,8,17,-2,-1,12,35,14,13,
%U A364933 10,-1,14,25,16,15,-2,-1,8,-1,-2,27,30,31,6,-1,14,19,12
%N A364933 a(n) = Sum_{k=1..n} A191898(n,k)*[A191904(n,k) = A191898(n,k)].
%F A364933 a(n) = Sum_{k=1..n} A191898(n,k)*[A191904(n,k) = A191898(n,k)].
%F A364933 Conjecture: a(n) = A057859(n) - A008472(n) - 1.
%t A364933 f[n_] := DivisorSum[n, MoebiusMu[#] # &]; Table[Sum[If[If[Mod[n, k] == 0, 1 - k, 1] == f[GCD[n, k]], f[GCD[n, k]], 0], {k, 1, n}], {n, 1, 70}]
%Y A364933 Cf. A191898, A191904, A057859, A008472.
%K A364933 sign
%O A364933 1,6
%A A364933 _Mats Granvik_, Aug 13 2023