This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A095005 #18 Jun 20 2024 02:37:19
%S A095005 0,1,2,2,5,8,19,20,48,75,160,242,505,835,1761,2799,5890,10250,20921,
%T A095005 36872,74316,134816,267749,492286,977207,1823657,3598657,6779899,
%U A095005 13336543,25358424,49763462,95140695,186504600,358630024,702300885,1356118149,2654709953,5142968571
%N A095005 Number of odious primes (A027697) in range ]2^n,2^(n+1)].
%H A095005 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>.
%H A095005 <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 A095005 a(n) = A036378(n) - A095006(n).
%t A095005 Table[Count[Prime@ Range[PrimePi[2^n] + 1, PrimePi[2^(n + 1) - 1]], k_ /; OddQ@ First@ DigitCount[k, 2]], {n, 24}] (* _Michael De Vlieger_, Feb 25 2017 *)
%o A095005 (PARI) a(n) = #select(x->((hammingweight(x)%2)==1),primes([2^n+1,2^(n+1)])); \\ _Michel Marcus_, Feb 26 2017
%Y A095005 Cf. A027697, A036378, A095006.
%K A095005 nonn
%O A095005 1,3
%A A095005 _Antti Karttunen_ and _Labos Elemer_, Jun 01 2004
%E A095005 a(34)-a(38) from _Amiram Eldar_, Jun 20 2024