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 A325813 #9 May 28 2019 19:35:12
%S A325813 1,1,1,1,1,6,1,1,1,2,1,4,1,2,3,1,1,3,1,2,1,2,1,12,1,2,1,12,1,6,1,1,3,
%T A325813 2,1,1,1,2,1,2,1,6,1,4,3,2,1,4,1,7,3,6,1,6,1,8,1,2,1,12,1,2,1,1,1,6,1,
%U A325813 2,3,2,1,3,1,2,1,12,1,6,1,2,1,2,1,4,1,2,3,4,1,18,7,4,1,2,5,12,1,1,21,1,1,6,1,2,3
%N A325813 a(n) = gcd(A034448(n)-n, n-A048146(n)), where A034448 and A048146 are respectively the sum of unitary and non-unitary divisors of n.
%H A325813 Antti Karttunen, <a href="/A325813/b325813.txt">Table of n, a(n) for n = 1..65537</a>
%F A325813 a(n) = gcd(A034460(n), A325814(n)).
%o A325813 (PARI)
%o A325813 A034448(n) = { my(f=factorint(n)); prod(k=1, #f~, 1+(f[k, 1]^f[k, 2])); }; \\ After code in A034448
%o A325813 A034460(n) = (A034448(n) - n);
%o A325813 A048146(n) = (sigma(n)-A034448(n));
%o A325813 A325814(n) = (n-A048146(n));
%o A325813 A325813(n) = gcd(A034460(n), A325814(n));
%Y A325813 Cf. A034460, A323166, A325812, A325814.
%Y A325813 Cf. also A325385.
%K A325813 nonn
%O A325813 1,6
%A A325813 _Antti Karttunen_, May 23 2019