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 A066148 #32 Feb 10 2025 15:04:52
%S A066148 3,7,19,31,43,53,67,73,79,97,103,107,109,127,139,149,163,197,271,283,
%T A066148 307,313,331,367,379,397,409,419,421,431,433,439,443,457,463,487,491,
%U A066148 499,523,547,571,593,599,619,643,673,683,691,739,751,773,797,811,821
%N A066148 Primes with an even number of 0's in binary expansion.
%H A066148 T. D. Noe, <a href="/A066148/b066148.txt">Table of n, a(n) for n = 1..1000</a>
%t A066148 Select[Prime[Range[200]],EvenQ[DigitCount[#,2,0]]&] (* _Harvey P. Dale_, Mar 04 2017 *)
%o A066148 (PARI)
%o A066148 a066148(m) = local(p,v,z); forprime(p=2,m,v=binary(p); z=0; for(j=1,matsize(v)[2], if(v[j]==0,z++)); if(z%2==0,print1(p,",")))
%o A066148 a066148(850)
%o A066148 (PARI) f(p)={v=binary(p);s=0;for(k=1,#v,if(v[k]==0, s++));return(1-s%2)};forprime(p=3,821,if(f(p),print1(p,", "))) \\ _Washington Bomfim_, Jan 14 2011
%o A066148 (PARI) forprime(p=2, 10^3, if( #select(x->x==0, digits(p,2))%2==0, print1(p,", "))); \\ _Joerg Arndt_, Jun 16 2018
%Y A066148 Cf. A066149, A027699, A027697.
%Y A066148 Cf. A059010
%K A066148 nonn,easy,base
%O A066148 1,1
%A A066148 _R. K. Guy_, Dec 13 2001
%E A066148 More terms from _Vladeta Jovovic_ and _Klaus Brockhaus_, Dec 13 2001