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 A325318 #9 Apr 22 2019 13:50:02
%S A325318 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,16,0,0,0,0,0,0,4,0,0,0,0,0,0,0,
%T A325318 0,12,0,0,0,0,0,0,0,32,16,0,0,0,0,2,0,40,0,12,0,0,0,0,0,64,0,0,0,0,0,
%U A325318 0,0,0,0,0,0,4,0,0,0,16,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,16,32,2,0,0,0,40,0
%N A325318 a(n) = A048250(n) AND A162296(n), where AND is the bitwise-AND, A004198.
%H A325318 Antti Karttunen, <a href="/A325318/b325318.txt">Table of n, a(n) for n = 1..65537</a>
%H A325318 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A325318 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A325318 a(n) = A004198(A048250(n), A162296(n)).
%F A325318 a(n) = A000203(n) - A325316(n) = (A000203(n) - A325317(n))/2.
%F A325318 a(n) = A325316(n) - A325317(n).
%t A325318 Array[BitAnd @@ Map[Total, {#3, Complement[#2, #3]}] & @@ {#1, #2, Select[#2, SquareFreeQ]} & @@ {#, Divisors[#]} &, 105] (* _Michael De Vlieger_, Apr 21 2019 *)
%o A325318 (PARI)
%o A325318 A048250(n) = factorback(apply(p -> p+1,factor(n)[,1]));
%o A325318 A162296(n) = sumdiv(n, d, d*(1-issquarefree(d)));
%o A325318 A325318(n) = bitand(A048250(n),A162296(n));
%Y A325318 Cf. A000203, A004198, A048250, A162296, A325316, A325317.
%K A325318 nonn
%O A325318 1,18
%A A325318 _Antti Karttunen_, Apr 21 2019