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 A329602 #7 Nov 20 2019 09:34:53
%S A329602 1,1,1,2,1,2,1,2,6,2,1,2,1,2,6,4,1,6,1,2,6,2,1,4,30,2,6,2,1,6,1,4,6,2,
%T A329602 30,12,1,2,6,4,1,6,1,2,6,2,1,4,210,30,6,2,1,12,30,4,6,2,1,12,1,2,6,8,
%U A329602 30,6,1,2,6,30,1,12,1,2,30,2,210,6,1,4,36,2,1,12,30,2,6,4,1,12,210,2,6,2,30,8,1,210,6,60,1,6,1,4,30
%N A329602 Square root of largest square dividing A108951(n), where A108951 is fully multiplicative with a(prime(i)) = prime(i)# = Product_{i=1..i} A000040(i).
%H A329602 Antti Karttunen, <a href="/A329602/b329602.txt">Table of n, a(n) for n = 1..10201</a>
%F A329602 a(n) = A000188(A108951(n)).
%o A329602 (PARI)
%o A329602 A000188(n) = core(n, 1)[2]; \\ From A000188
%o A329602 A034386(n) = prod(i=1, primepi(n), prime(i));
%o A329602 A108951(n) = { my(f=factor(n)); prod(i=1, #f~, A034386(f[i, 1])^f[i, 2]) }; \\ From A108951
%o A329602 A329602(n) = A000188(A108951(n));
%Y A329602 Cf. A000188, A108951.
%K A329602 nonn
%O A329602 1,4
%A A329602 _Antti Karttunen_, Nov 19 2019