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 A323160 #8 Jan 09 2019 21:22:46
%S A323160 1,1,1,1,1,6,1,1,1,2,1,4,1,2,3,1,1,6,1,2,1,2,1,12,1,2,1,4,1,6,1,1,3,2,
%T A323160 1,2,1,2,1,2,1,6,1,4,3,2,1,4,1,2,3,2,1,6,1,8,1,2,1,12,1,2,1,1,1,6,1,2,
%U A323160 3,2,1,6,1,2,1,4,1,6,1,2,1,2,1,4,1,2,3,4,1,18,7,4,1,2,5,12,1,2,3,2,1,6,1,2,3
%N A323160 a(n) = gcd(n, A323159(n)) = gcd(n, A034448(n), A048250(n)).
%H A323160 Antti Karttunen, <a href="/A323160/b323160.txt">Table of n, a(n) for n = 1..65537</a>
%F A323160 a(n) = gcd(n, A323159(n)) = gcd(A048250(n), A323166(n)).
%F A323160 a(n) = gcd(n, A034448(n), A048250(n)).
%o A323160 (PARI)
%o A323160 A034448(n) = { my(f=factorint(n)); prod(k=1, #f~, 1+(f[k, 1]^f[k, 2])); }; \\ After code in A034448
%o A323160 A048250(n) = factorback(apply(p -> p+1,factor(n)[,1]));
%o A323160 A323160(n) = gcd(n, gcd(A034448(n), A048250(n)));
%Y A323160 Cf. A034448, A048250, A323159, A323163, A323166.
%K A323160 nonn
%O A323160 1,6
%A A323160 _Antti Karttunen_, Jan 09 2019