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 A340679 #18 May 23 2021 19:24:45
%S A340679 1,1,1,1,1,6,1,1,1,10,1,6,1,14,15,1,1,6,1,10,21,22,1,6,1,26,1,14,1,30,
%T A340679 1,1,33,34,35,6,1,38,39,10,1,42,1,22,15,46,1,6,1,10,51,26,1,6,55,14,
%U A340679 57,58,1,30,1,62,21,1,65,66,1,34,69,70,1,6,1,74,15,38,77,78,1,10,1,82,1,42,85,86,87,22,1,30,91,46
%N A340679 If n is a power of prime then a(n) = 1, otherwise a(n) = product of the distinct prime factors of n.
%H A340679 Antti Karttunen, <a href="/A340679/b340679.txt">Table of n, a(n) for n = 1..16384</a>
%H A340679 Antti Karttunen, <a href="/A340679/a340679.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%F A340679 If A010055(n) == 1 [when n is a power of prime], a(n) = 1, otherwise a(n) = A007947(n).
%F A340679 a(n) = A007947(n) / A014963(n).
%t A340679 Table[If[PrimePowerQ[n],1,Times@@FactorInteger[n][[All,1]]],{n,100}] (* _Harvey P. Dale_, May 23 2021 *)
%o A340679 (PARI) A340679(n) = if(isprimepower(n),1,factorback(factorint(n)[, 1]));
%Y A340679 Cf. A000961 (positions of ones), A007947, A010055, A014963.
%Y A340679 Cf. also A048671, A322591.
%K A340679 nonn
%O A340679 1,6
%A A340679 _Antti Karttunen_, Feb 01 2021