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!)
A108138 n to the power of the smallest prime divisor of n. 1

%I #7 Oct 01 2013 17:58:12

%S 4,27,16,3125,36,823543,64,729,100,285311670611,144,302875106592253,

%T 196,3375,256,827240261886336764177,324,1978419655660313589123979,400,

%U 9261,484,20880467999847912034355032910567,576,9765625,676,19683,784

%N n to the power of the smallest prime divisor of n.

%H Harvey P. Dale, <a href="/A108138/b108138.txt">Table of n, a(n) for n = 2..300</a>

%t Table[n^FactorInteger[n][[1,1]],{n,2,30}] (* _Harvey P. Dale_, Dec 04 2012 *)

%o (PARI) xtosdiv(n) = \x to the power of smallest prime divisor of x <= n { local(z); for(x=2,n, y=Vec(factor(x)); z=x^y[1][1]; print1(z",") ) }

%K easy,nonn

%O 2,1

%A _Cino Hilliard_, Jun 05 2005

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 April 18 21:51 EDT 2024. Contains 371781 sequences. (Running on oeis4.)