login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112622 If p^b(p,n) is the highest power of the prime p dividing n, then a(n) = product_{p|n} b(p,n)^b(p,n). 0
1, 1, 1, 4, 1, 1, 1, 27, 4, 1, 1, 4, 1, 1, 1, 256, 1, 4, 1, 4, 1, 1, 1, 27, 4, 1, 27, 4, 1, 1, 1, 3125, 1, 1, 1, 16, 1, 1, 1, 27, 1, 1, 1, 4, 4, 1, 1, 256, 4, 4, 1, 4, 1, 27, 1, 27, 1, 1, 1, 4, 1, 1, 4, 46656, 1, 1, 1, 4, 1, 1, 1, 108, 1, 1, 4, 4, 1, 1, 1, 256, 256, 1, 1, 4, 1, 1, 1, 27, 1, 4, 1, 4 (list; graph; refs; listen; history; internal format)
OFFSET

2,4

EXAMPLE

45 = 3^2 * 5^1. So a(45) = 2^2 * 1^1 = 4.

MATHEMATICA

f[n_] := Block[{fi = Last@Transpose@FactorInteger@n}, Times @@ (fi^fi)]; Rest@Array[f, 93] (* Robert G. Wilson v *)

PROG

(PARI) a(n)=local(v, r, i); v=factorint(n); r=1; for(i=1, matsize(v)[1], r*=v[i, 2]^v[i, 2]); r (Herrgesell)

CROSSREFS

Sequence in context: A063851 A124777 A203639 * A183104 A183102 A178649

Adjacent sequences:  A112619 A112620 A112621 * A112623 A112624 A112625

KEYWORD

nonn,mult

AUTHOR

Leroy Quet Dec 25 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com) and Lambert Herrgesell (zero815(AT)googlemail.com), Dec 27 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 01:35 EST 2012. Contains 205567 sequences.