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 A336567 #10 Jul 28 2020 14:02:04
%S A336567 0,0,0,1,0,0,0,3,1,0,0,1,0,0,0,7,0,1,0,1,0,0,0,3,1,0,4,1,0,0,0,15,0,0,
%T A336567 0,6,0,0,0,3,0,0,0,1,1,0,0,7,1,1,0,1,0,4,0,3,0,0,0,1,0,0,1,31,0,0,0,1,
%U A336567 0,0,0,16,0,0,1,1,0,0,0,7,13,0,0,1,0,0,0,3,0,1,0,1,0,0,0,15,0,1,1,8,0,0,0,3,0
%N A336567 Sum of proper divisors of {n divided by its largest squarefree divisor}.
%H A336567 Antti Karttunen, <a href="/A336567/b336567.txt">Table of n, a(n) for n = 1..16384</a>
%H A336567 Antti Karttunen, <a href="/A336567/a336567.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%F A336567 a(n) = A001065(A003557(n)).
%F A336567 a(n) = A335341(n) - A003557(n) = A336563(n) / A007947(n).
%o A336567 (PARI)
%o A336567 A007947(n) = factorback(factorint(n)[, 1]);
%o A336567 A057723(n) = { my(r=A007947(n)); (r*sigma(n/r)); };
%o A336567 A336563(n) = (A057723(n)-n);
%o A336567 A336567(n) = (A336563(n)/A007947(n));
%Y A336567 Cf. A000203, A001065, A003557, A007947, A057723, A335341, A336563.
%K A336567 nonn
%O A336567 1,8
%A A336567 _Antti Karttunen_, Jul 27 2020