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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052410 Write n = m^k with m, k integers, k >= 1, then a(n) = smallest possible choice for m. 9
1, 2, 3, 2, 5, 6, 7, 2, 3, 10, 11, 12, 13, 14, 15, 2, 17, 18, 19, 20, 21, 22, 23, 24, 5, 26, 3, 28, 29, 30, 31, 2, 33, 34, 35, 6, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 7, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 2, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Value of m in m^p=n, where p is the largest possible power (see A052409).

For n>1, n is a perfect power iff a(n)<>n. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 13 2002

LINKS

Daniel Forgues, Table of n, a(n) for n=1..100000

Eric Weisstein's World of Mathematics, Power

Eric Weisstein's World of Mathematics, Perfect Power

MATHEMATICA

Table[If[n==1, 1, n^(1/(GCD@@(Last/@FactorInteger[n])))], {n, 100}]

CROSSREFS

Cf. A052409, A175781.

a(A001597(k))=A025478(k).

Sequence in context: A053166 A166140 A019555 * A175781 A072775 A090078

Adjacent sequences:  A052407 A052408 A052409 * A052411 A052412 A052413

KEYWORD

nonn

AUTHOR

Eric Weisstein (eric(AT)weisstein.com)

EXTENSIONS

Definition edited (in a complementary form to A052409) by Daniel Forgues, Mar 14 2009

Corrected by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Sep 02 2009

Definition edited by N. J. A. Sloane, Sep 03 2010

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 15 21:10 EST 2012. Contains 205856 sequences.