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!)
A353946 a(n) = (pi(2n-1) - pi(n-1))^pi(n) for n > 1, a(1) = 0. 0

%I #5 May 13 2022 09:53:00

%S 0,2,4,4,8,8,81,16,81,256,1024,1024,4096,729,4096,15625,78125,16384,

%T 390625,65536,390625,1679616,10077696,10077696,10077696,10077696,

%U 40353607,40353607,282475249,282475249,8589934592,1977326743,1977326743,8589934592,8589934592,31381059609,1000000000000

%N a(n) = (pi(2n-1) - pi(n-1))^pi(n) for n > 1, a(1) = 0.

%C Number of functions from P to Q, where P is the set of primes <= n and Q is the set of primes q such that n <= q <= 2n-1.

%F a(n) = A035250(n)^A000720(n) for n > 1, a(1) = 0.

%t Join[{0}, Table[(PrimePi[2 n - 1] - PrimePi[n - 1])^PrimePi[n], {n, 2, 30}]]

%Y Cf. A000720 (pi), A035250, A352749.

%K nonn

%O 1,2

%A _Wesley Ivan Hurt_, May 12 2022

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