login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095007 Number of 4k+1 primes (A002144) in range ]2^n,2^(n+1)]. 3

%I

%S 0,1,1,2,4,6,10,21,38,66,127,233,432,805,1511,2837,5378,10186,19294,

%T 36827,70157,133975,256852,492882,946848,1823129,3513599,6780412,

%U 13103462,25348870,49090415,95167380,184662052

%N Number of 4k+1 primes (A002144) in range ]2^n,2^(n+1)].

%H A. Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>

%H <a href="/index/Pri#primesubsetpop2">Index entries for sequences related to occurrences of various subsets of primes in range ]2^n,2^(n+1)]</a>

%Y a(n) = A036378(n)-A095008(n) = A095009(n)+A095011(n).

%K nonn

%O 1,4

%A _Antti Karttunen_ and _Labos Elemer_, Jun 01 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 04:56 EST 2016. Contains 279034 sequences.