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 A324284 #6 Feb 20 2019 21:44:07
%S A324284 1,1,3,1,1,6,1,1,3,2,1,6,1,2,3,1,1,18,1,2,3,2,1,6,25,2,3,2,1,6,1,1,3,
%T A324284 2,5,18,1,2,3,10,1,6,1,2,45,2,1,6,7,50,3,2,1,18,5,2,3,2,1,12,1,2,3,1,
%U A324284 5,6,1,2,3,10,1,18,1,2,75,2,1,6,1,10,3,2,1,12,5,2,3,2,1,90,1,2,3,2,5,6,1,14,9,50,1,6,1,2,15
%N A324284 a(n) = gcd(n, A324283(n)).
%H A324284 Antti Karttunen, <a href="/A324284/b324284.txt">Table of n, a(n) for n = 1..10000</a>
%H A324284 Antti Karttunen, <a href="/A324284/a324284.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%F A324284 a(n) = gcd(n, A324283(n)).
%o A324284 (PARI)
%o A324284 A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
%o A324284 A324283(n) = { my(f=factor(n)); prod(i=1, #f~, A276086(f[i,1]^f[i,2])); };
%o A324284 A324284(n) = gcd(n, A324283(n));
%Y A324284 Cf. A276086, A324283.
%K A324284 nonn
%O A324284 1,3
%A A324284 _Antti Karttunen_, Feb 20 2019