login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A354090 a(n) = A007947(n)^(A051904(n) - 1), where A007947 is squarefree kernel and A051904 is minimum prime exponent. 2
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) = A007947(n)^(A051904(n)-1).
a(n) = n / A304776(n).
MATHEMATICA
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 *)
PROG
(PARI)
A007947(n) = factorback(factorint(n)[, 1]);
A051904(n) = if((1==n), 0, vecmin(factor(n)[, 2]));
A354090(n) = (A007947(n)^(A051904(n)-1));
(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
CROSSREFS
Sequence in context: A337087 A321312 A327502 * A362826 A220632 A125653
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 19 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 13 04:46 EDT 2024. Contains 374267 sequences. (Running on oeis4.)