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 A354090 #11 Feb 12 2023 03:13:33
%S A354090 1,1,1,2,1,1,1,4,3,1,1,1,1,1,1,8,1,1,1,1,1,1,1,1,5,1,9,1,1,1,1,16,1,1,
%T A354090 1,6,1,1,1,1,1,1,1,1,1,1,1,1,7,1,1,1,1,1,1,1,1,1,1,1,1,1,1,32,1,1,1,1,
%U A354090 1,1,1,6,1,1,1,1,1,1,1,1,27,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,10,1,1,1,1,1
%N A354090 a(n) = A007947(n)^(A051904(n) - 1), where A007947 is squarefree kernel and A051904 is minimum prime exponent.
%H A354090 Antti Karttunen, <a href="/A354090/b354090.txt">Table of n, a(n) for n = 1..65537</a>
%F A354090 a(n) = A007947(n)^(A051904(n)-1).
%F A354090 a(n) = n / A304776(n).
%t A354090 a[n_] := Module[{f = FactorInteger[n], e}, e = Min[f[[;; , 2]]] - 1; f[[;; , 2]] = e; Times @@ Power @@@ f]; Array[a, 100] (* _Amiram Eldar_, Feb 12 2023 *)
%o A354090 (PARI)
%o A354090 A007947(n) = factorback(factorint(n)[, 1]);
%o A354090 A051904(n) = if((1==n),0,vecmin(factor(n)[, 2]));
%o A354090 A354090(n) = (A007947(n)^(A051904(n)-1));
%o A354090 (PARI) a(n) = {if(n==1, 1, my(f = factor(n), e = vecmin(f[,2]) - 1); prod(i = 1, #f~, f[i,1]^e));} \\ _Amiram Eldar_, Feb 12 2023
%Y A354090 Cf. A007947, A051904, A304776.
%K A354090 nonn
%O A354090 1,4
%A A354090 _Antti Karttunen_, May 19 2022