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!)
A363918 a(n) = Product_{p in Factors(n)} mult(p)*n^(mult(p) - 1), where Factors(n) is the integer factorization of n and mult(p) the multiplicity of the prime factor p. 1
1, 1, 1, 8, 1, 1, 1, 192, 18, 1, 1, 24, 1, 1, 1, 16384, 1, 36, 1, 40, 1, 1, 1, 1728, 50, 1, 2187, 56, 1, 1, 1, 5242880, 1, 1, 1, 5184, 1, 1, 1, 4800, 1, 1, 1, 88, 90, 1, 1, 442368, 98, 100, 1, 104, 1, 8748, 1, 9408, 1, 1, 1, 120, 1, 1, 126, 6442450944, 1, 1, 1, 136 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) / A363919(n) = A005361(n).
a(n) * A205959(n) = A005361(n) * A363923(n) = A363917(n).
MAPLE
a := n -> local p: mul(p[2] * n^(p[2] - 1), p in ifactors(n)[2]):
seq(a(n), n = 1..68);
PROG
(PARI) a(n) = my(f=factor(n)[, 2]); vecprod(f)*n^(vecsum(f)-#f); \\ Michel Marcus, Jul 19 2023
CROSSREFS
Sequence in context: A181064 A010153 A360970 * A133421 A128881 A154015
KEYWORD
nonn
AUTHOR
Peter Luschny, Jul 19 2023
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 April 15 20:47 EDT 2024. Contains 371696 sequences. (Running on oeis4.)