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!)
A112953 a(1) = 0; a(n) = pi(n)^pi(n) for n>1, where pi is the prime counting function (A000720). 0

%I #12 Jun 13 2022 12:37:31

%S 0,1,4,4,27,27,256,256,256,256,3125,3125,46656,46656,46656,46656,

%T 823543,823543,16777216,16777216,16777216,16777216,387420489,

%U 387420489,387420489,387420489,387420489,387420489,10000000000,10000000000

%N a(1) = 0; a(n) = pi(n)^pi(n) for n>1, where pi is the prime counting function (A000720).

%e pi(5) = 3, so a(5) = 3^3 = 27.

%e pi(11) = 5, so a(11) = 5^5 = 3125.

%t Join[{0},#^#&/@PrimePi[Range[2,30]]] (* _Harvey P. Dale_, Sep 19 2019 *)

%o (PARI) a(n) = if (n==1, 0, primepi(n)^primepi(n)); \\ _Michel Marcus_, Jun 01 2013; corrected Jun 13 2022

%Y Cf. A000720 (pi).

%K base,easy,nonn

%O 1,3

%A _Alexandre Wajnberg_, Jan 02 2006

%E More terms from _Michel Marcus_, Jun 01 2013

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 July 16 05:19 EDT 2024. Contains 374343 sequences. (Running on oeis4.)