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!)
A243405 Minimum among the numbers p^(n/p), where p is a prime factor of n. 2

%I #8 Jun 16 2014 01:40:41

%S 1,2,3,4,5,8,7,16,27,25,11,64,13,49,125,256,17,512,19,625,343,121,23,

%T 4096,3125,169,19683,2401,29,15625,31,65536,1331,289,16807,262144,37,

%U 361,2197,390625,41,117649,43,14641,1953125,529,47,16777216,823543,9765625,4913,28561,53

%N Minimum among the numbers p^(n/p), where p is a prime factor of n.

%C The setting a(1)=1 is conventional.

%C Upper bound (for any n): a(n) <= (3^(1/3))^n = A002581^n.

%H Stanislav Sykora, <a href="/A243405/b243405.txt">Table of n, a(n) for n = 1..2000</a>

%F For prime p, a(p)=p.

%F For n>1: When gpf(n)>3 then a(n)=gpf(n)^(n/gpf(n)); otherwise if n is even then a(n)=2^(n/2); otherwise a(n)=3^(n/3).

%F If n is in A033845, a(n) = 2^(n/2); otherwise a(n) = gpf(n)^(n/gpf(n)). - _Franklin T. Adams-Watters_, Jun 15 2014

%e a(12)=64 because 2^(12/2)=64 is smaller than 3^(12/3)=81.

%o (PARI) A243405(n)= {my(m,k,p,q);if(n==1,return(1));

%o p=factor(n);m=2^n;

%o for(k=1,#p[,1],q=p[k,1]^(n\p[k,1]);if(q<m,m=q));

%o return (m);}

%Y Cf. A002581, A092975 (maximum instead of minimum), A033845.

%K nonn

%O 1,2

%A _Stanislav Sykora_, Jun 04 2014

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 March 29 22:15 EDT 2024. Contains 371282 sequences. (Running on oeis4.)