|
%I #6 Mar 31 2012 14:02:22
%S 0,0,0,1,2,3,7,11,27,40,80,130,343,482,1180,1756,4473,6479,15387,
%T 24022,58714,89306,213397,335115,802311,1265350,2965114,4781514,
%U 11185644,18079040,42048314,68709969,159433693
%N Number of primes with number of 1-bits <= number of 0-bits (A095075) in range ]2^n,2^(n+1)].
%H A. Karttunen and J. 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>
%Y a(n) = A095019(n) + (if n is odd) A095018((n+1)/2).
%K nonn
%O 1,5
%A _Antti Karttunen_, Jun 01 2004
|
