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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095054 Number of primes with number of 0-bits <= number of 1-bits (A095074) in range ]2^n,2^(n+1)]. 3
1, 2, 2, 4, 7, 10, 20, 32, 65, 97, 203, 334, 718, 1130, 2381, 3953, 8266, 13911, 28995, 49564, 105524, 178910, 376969, 650703, 1383287, 2380394, 5044969, 8780393, 18699214, 32618497, 69349061, 121625616, 259051224 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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) = A095020(n) + (if n is odd) A095018((n+1)/2).

Sequence in context: A095092 A094686 A277752 * A316210 A032162 A000983

Adjacent sequences:  A095051 A095052 A095053 * A095055 A095056 A095057

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 25 12:01 EDT 2019. Contains 324352 sequences. (Running on oeis4.)