Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Jun 13 2024 08:17:08
%S 1,1,2,1,2,7,12,14,27,50,91,178,335,611,1156,2147,4042,7831,14724,
%T 28227,53736,102482,196303,376121,723408,1393572,2683465,5180304,
%U 10009707,19366479,37509260,72706948,141074303,273975483,532538340
%N Number of fib00 primes (A095082) 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) = A095060(n) - A095067(n) = A095065(n) + A095068(n).
%Y Cf. A095060, A095065, A095067, A095068, A095082.
%K nonn,more
%O 1,3
%A _Antti Karttunen_, Jun 01 2004
%E a(34)-a(35) from _Amiram Eldar_, Jun 13 2024