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 A095052 #10 Jun 13 2024 10:51:56 %S A095052 0,1,3,10,25,78,283,906,3044,10920,37920,135182,487555,1764216, %T A095052 6415902,23585285,86789112,320972293,1192327462,4441973622 %N A095052 Number of primes with number of 0-bits equal to one plus number of 1-bits (A095072) in range ]2^2n,2^(2n+1)]. %H A095052 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095052 <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>. %e A095052 In the range ]2^4,2^5] 17 (10001 in binary) is the only such prime thus a(2) = 1. %Y A095052 Cf. A095018, A095072. %K A095052 nonn,more %O A095052 1,3 %A A095052 _Antti Karttunen_, Jun 01 2004 %E A095052 a(17)-a(20) from _Amiram Eldar_, Jun 13 2024