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 A347377 #9 Oct 16 2021 15:42:57
%S A347377 0,0,0,0,0,0,0,6,0,-6,0,12,0,-6,0,30,0,24,0,12,0,-24,0,48,0,-24,60,24,
%T A347377 0,24,0,114,-20,-42,0,84,0,-42,-10,60,0,48,0,12,60,-48,0,168,0,6,-30,
%U A347377 24,0,132,0,108,-30,-78,0,96,0,-72,120,390,0,44,0,12,-30,36,0,288,0,-96,60,24,0,58,0,228,360,-114
%N A347377 Möbius transform of A280692, A003961(n) - A250469(n).
%H A347377 Antti Karttunen, <a href="/A347377/b347377.txt">Table of n, a(n) for n = 1..10000</a>
%H A347377 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A347377 <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>
%F A347377 a(n) = Sum_{d|n} A008683(n/d) * A280692(d).
%F A347377 a(n) = A003972(n) - A347376(n).
%o A347377 (PARI)
%o A347377 A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
%o A347377 A280692(n) = (A003961(n) - A250469(n));
%o A347377 A347377(n) = sumdiv(n,d,moebius(n/d)*A280692(d));
%Y A347377 Cf. A003961, A003972, A008683, A250469, A280692, A347376.
%Y A347377 Cf. also A346480.
%K A347377 sign
%O A347377 1,8
%A A347377 _Antti Karttunen_, Sep 01 2021