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 A353372 #10 Apr 20 2022 09:58:34
%S A353372 1,1,1,1,1,2,1,1,1,1,1,2,1,2,2,1,1,2,1,1,1,1,1,2,1,2,1,2,1,3,1,1,2,1,
%T A353372 2,3,1,2,1,1,1,3,1,1,2,1,1,2,1,1,2,2,1,2,1,2,1,2,1,3,1,1,1,1,2,3,1,1,
%U A353372 2,3,1,3,1,2,2,2,2,3,1,1,1,1,1,4,1,2,1,1,1,4,1,1,2,1,2,2,1,2,2,1,1,3,1,2,3
%N A353372 Inverse Möbius transform of A353370.
%C A353372 Number of terms of A325698 that divide n.
%H A353372 Antti Karttunen, <a href="/A353372/b353372.txt">Table of n, a(n) for n = 1..65537</a>
%H A353372 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A353372 a(n) = Sum_{d|n} A353370(d).
%F A353372 a(n) = A000005(n) - A353371(n).
%F A353372 a(p) = 1 for all primes p.
%F A353372 a(n) = a(A003961(n)) = a(A348717(n)), for all n >= 1.
%o A353372 (PARI)
%o A353372 A353370(n) = { my(f = factor(n)); (0==sum(i=1, #f~, f[i,2]*((-1)^(primepi(f[i, 1])%2)))); };
%o A353372 A353372(n) = sumdiv(n,d,A353370(d));
%Y A353372 Cf. A000005, A003961, A325698, A353370, A353371.
%K A353372 nonn
%O A353372 1,6
%A A353372 _Antti Karttunen_, Apr 16 2022