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!)
A101405 a(n) = n^(pi(n-1)). 1

%I #10 Sep 24 2018 16:53:14

%S 1,1,3,16,25,216,343,4096,6561,10000,14641,248832,371293,7529536,

%T 11390625,16777216,24137569,612220032,893871739,25600000000,

%U 37822859361,54875873536,78310985281,2641807540224,3814697265625,5429503678976

%N a(n) = n^(pi(n-1)).

%C pi(n) (A000720) is the number of prime numbers less than or equal to n.

%e a(5)=25 because a(5)= 5^(pi(4))= 5^2= 25

%e If n=10, m=4, so 10^4 = 10000.

%t Table[n^PrimePi[n - 1], {n, 30}]

%Y Cf. A000720.

%K nonn

%O 1,3

%A _Parthasarathy Nambi_, Jan 15 2005

%E Extended by _Ray Chandler_, Jan 18 2005

%E Edited by _N. J. A. Sloane_ at the suggestion of _Andrew S. Plewe_, Jun 16 2007

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 23 11:26 EDT 2024. Contains 371913 sequences. (Running on oeis4.)