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

%I #10 Jun 13 2024 10:51:41

%S 1,2,2,4,7,10,20,32,65,97,203,334,718,1130,2381,3953,8266,13911,28995,

%T 49564,105524,178910,376969,650703,1383287,2380394,5044969,8780393,

%U 18699214,32618497,69349061,121625616,259051224,455265038,968649497,1711760073,3647018733,6457387921,13745846521,24430016732

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

%H Antti Karttunen and John 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>.

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

%Y Cf. A095018, A095020, A095074.

%K nonn

%O 1,2

%A _Antti Karttunen_, Jun 01 2004

%E a(34)-a(40) from _Amiram Eldar_, Jun 13 2024