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 A095053 #11 Jun 13 2024 10:51:49 %S A095053 1,1,5,11,28,105,362,1093,3659,13001,45171,159510,563833,2008295, %T A095053 7333827,26730538,97256891,358079458,1324674524,4902380577 %N A095053 Number of primes with number of 1-bits equal to one plus number 0-bits (A095073) in range ]2^2n,2^(2n+1)]. %H A095053 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095053 <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 A095053 In the range ]2^2,2^3] 5 (101 in binary) is the only such prime thus a(1) = 1. %e A095053 Similarly, in the range ]2^4,2^5] 19 (10011 in binary) is also unique in that respect, thus a(2) = 1 as well. %Y A095053 Cf. A095018, A095073. %K A095053 nonn,more %O A095053 1,3 %A A095053 _Antti Karttunen_, Jun 01 2004 %E A095053 a(17)-a(20) from _Amiram Eldar_, Jun 13 2024