|
%I #6 Mar 31 2012 14:02:22
%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
%N Number of primes with number of 0-bits <= number of 1-bits (A095074) 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) = A095020(n) + (if n is odd) A095018((n+1)/2).
%K nonn
%O 1,2
%A _Antti Karttunen_, Jun 01 2004
|
