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!)
A176811 Number of primes between 2*(lesser of n-th twin prime pair) and 2*(greater of n-th twin prime pair). 1

%I #11 Jul 21 2023 14:06:13

%S 1,2,1,1,2,1,0,0,0,0,1,0,1,1,1,1,1,1,1,0,0,1,1,0,0,0,1,1,1,2,2,0,1,0,

%T 0,1,1,1,0,0,0,1,1,1,0,0,1,1,1,0,1,0,0,0,0,0,0,0,1,0,0,1,0,1,0,2,1,0,

%U 0,1,1,0,2,0,0,0,0,0,1,0,1,0,0,1,0,0,1,2,1,0,2,0,0,1,1,0,0,0,1,1,1,0,0,0,1

%N Number of primes between 2*(lesser of n-th twin prime pair) and 2*(greater of n-th twin prime pair).

%C Number of primes between 2*A001359(n) and 2*A006512(n).

%C Number of primes between A108605(n) and A176810(n).

%C Number of primes between 2*A077800(2n-1) and 2*A077800(2n).

%e a(1)=1 because 2*3 < 7 (prime) < 2*5;

%e a(2)=2 because 2*5 < 11 (prime) < 13(prime) < 2*7;

%e a(3)=1 because 2*11 < 23 (prime) < 2*13.

%p A001359 := proc(n) option remember; if n = 1 then 3; else for a from procname(n-1)+2 by 2 do if isprime(a) and isprime(a+2) then return a; end if; end do: end if; end proc:

%p A006512 := proc(n) A001359(n)+2 ; end proc:

%p A176811 := proc(n) numtheory[pi](2*A006512(n)) - numtheory[pi](2*A001359(n)) ; end proc:

%p seq(A176811(n),n=1..120) ; # _R. J. Mathar_, Apr 27 2010

%t PrimePi[2*#[[2]]]-PrimePi[2*#[[1]]]&/@Select[Partition[Prime[Range[1000]],2,1],#[[2]]- #[[1]] == 2&] (* _Harvey P. Dale_, Jul 21 2023 *)

%Y Cf. A001359, A006512, A077800, A108605, A176810.

%K nonn

%O 1,2

%A _Juri-Stepan Gerasimov_, Apr 26 2010

%E Terms corrected starting at a(34) by _R. J. Mathar_, Apr 27 2010

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 19 04:26 EDT 2024. Contains 370952 sequences. (Running on oeis4.)