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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A175781 a(n) = n^(1/k) with the smallest k>1 such that n is a k-th power, taking k=1 if no such k>1 exists. 2

%I

%S 1,2,3,2,5,6,7,2,3,10,11,12,13,14,15,4,17,18,19,20,21,22,23,24,5,26,3,

%T 28,29,30,31,2,33,34,35,6,37,38,39,40,41,42,43,44,45,46,47,48,7,50,51,

%U 52,53,54,55,56,57,58,59,60,61,62,63,8,65,66,67,68,69,70,71,72,73,74,75

%N a(n) = n^(1/k) with the smallest k>1 such that n is a k-th power, taking k=1 if no such k>1 exists.

%H Robert Israel, <a href="/A175781/b175781.txt">Table of n, a(n) for n = 1..10000</a>

%e a(32) = 2 since the least k, in this case 5, yields 32^(1/5) = 2.

%p f:= proc(n) local F,m;

%p F:= ifactors(n)[2];

%p m:= igcd(op(map(t->t[2],F)));

%p if m = 1 then n

%p else m:= min(numtheory:-factorset(m)); mul(t[1]^(t[2]/m),t=F)

%p fi

%p end proc:

%p map(f, [\$1..100]); # _Robert Israel_, Jan 10 2018

%t perfectPowerQ[n_] := n == 1 || GCD @@ FactorInteger[n][[All, 2]] > 1; f[n_] := If[ perfectPowerQ@ n, k = 2; While[ !IntegerQ[n^(1/k)], k++]; n^(1/k), n]; Array[f, 75] (* _Robert G. Wilson v_, Jan 09 2018 *)

%o (PARI) a(n) = my(p = ispower(n)); if (!p, n, sqrtnint(n, divisors(p)[2])); \\ _Michel Marcus_, Jan 02 2018

%Y Cf. A007947, A052410.

%K nonn

%O 1,2

%A _Vincenzo Librandi_, Sep 03 2010

%E Edited by the Associate Editors of the OEIS, Sep 03 2010

%E a(32) corrected by _Gionata Neri_, Jan 02 2018

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 April 14 00:42 EDT 2021. Contains 342941 sequences. (Running on oeis4.)