The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A190125 If n = product(p_i^e_i), a(n) = product((p_i^e_i)^(p_i^e_i)). 0
 1, 4, 27, 256, 3125, 108, 823543, 16777216, 387420489, 12500, 285311670611, 6912, 302875106592253, 3294172, 84375, 18446744073709551616, 827240261886336764177, 1549681956, 1978419655660313589123979, 800000, 22235661, 1141246682444 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Multiplicative with a(p^e) = (p^e)^(p^e) = p^(e*p^e). Equivalently, product over pp a unitary prime power divisor of n of pp^pp. LINKS PROG (PARI) a(n)=local(fm, pp); fm=factor(n); prod(k=1, matsize(fm)[1], (pp=fm[k, 1]^fm[k, 2])^pp) CROSSREFS Cf. A133482. Sequence in context: A239491 A324804 A245409 * A324805 A245410 A324806 Adjacent sequences:  A190122 A190123 A190124 * A190126 A190127 A190128 KEYWORD nonn,mult AUTHOR Franklin T. Adams-Watters, May 05 2011 STATUS approved

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

Last modified December 7 22:50 EST 2021. Contains 349590 sequences. (Running on oeis4.)