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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095055 Number of primes with number of 1-bits <= number of 0-bits (A095075) in range ]2^n,2^(n+1)]. 3
0, 0, 0, 1, 2, 3, 7, 11, 27, 40, 80, 130, 343, 482, 1180, 1756, 4473, 6479, 15387, 24022, 58714, 89306, 213397, 335115, 802311, 1265350, 2965114, 4781514, 11185644, 18079040, 42048314, 68709969, 159433693 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Table of n, a(n) for n=1..33.

A. Karttunen and J. Moyer, C-program for computing the initial terms of this sequence

Index entries for sequences related to occurrences of various subsets of primes in range ]2^n,2^(n+1)]

CROSSREFS

a(n) = A095019(n) + (if n is odd) A095018((n+1)/2).

Sequence in context: A112843 A036651 A049454 * A305750 A107857 A107858

Adjacent sequences:  A095052 A095053 A095054 * A095056 A095057 A095058

KEYWORD

nonn

AUTHOR

Antti Karttunen, Jun 01 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 19 23:01 EDT 2019. Contains 324222 sequences. (Running on oeis4.)