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

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, 262002130, 602733406, 1000343760, 2297551889, 3828253857, 8748722270, 14683465908

Offset: 1

Author

Antti Karttunen, Jun 01 2004

Keywords

• nonn

Links

• 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)].

Crossrefs

Cf. A095018, A095019, A095075.

Formula

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

Extensions

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