A095054 Number of primes with number of 0-bits <= number of 1-bits (A095074) in range ]2^n,2^(n+1)].

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, 455265038, 968649497, 1711760073, 3647018733, 6457387921, 13745846521, 24430016732

Offset

1,2

Links

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

Antti Karttunen and John 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)].

Formula

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

Crossrefs

Cf. A095018, A095020, A095074.

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

Extensions

a(34)-a(40) from Amiram Eldar, Jun 13 2024

Status

approved