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 A095055 #10 Jun 13 2024 10:51:45 %S A095055 0,0,0,1,2,3,7,11,27,40,80,130,343,482,1180,1756,4473,6479,15387, %T A095055 24022,58714,89306,213397,335115,802311,1265350,2965114,4781514, %U A095055 11185644,18079040,42048314,68709969,159433693,262002130,602733406,1000343760,2297551889,3828253857,8748722270,14683465908 %N A095055 Number of primes with number of 1-bits <= number of 0-bits (A095075) in range ]2^n,2^(n+1)]. %H A095055 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095055 <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 A095055 a(n) = A095019(n) + (if n is odd) A095018((n+1)/2). %Y A095055 Cf. A095018, A095019, A095075. %K A095055 nonn %O A095055 1,5 %A A095055 _Antti Karttunen_, Jun 01 2004 %E A095055 a(34)-a(40) from _Amiram Eldar_, Jun 13 2024