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 A225222 #17 Apr 05 2020 21:29:55
%S A225222 3,7,11,13,23,29,31,47,59,61,79,103,107,109,127,191,223,239,251,367,
%T A225222 379,383,431,439,443,463,479,487,491,499,503,509,607,631,701,719,727,
%U A225222 733,743,751,757,761,823,827,829,859,863,877,883,887,911,919,941,947,953,967,971
%N A225222 Primes with more than twice as many 1's as 0's in binary.
%C A225222 Naslund proves that this sequence (and related ones) is infinite and gives an asymptotic upper bound.
%H A225222 Charles R Greathouse IV, <a href="/A225222/b225222.txt">Table of n, a(n) for n = 1..10000</a>
%H A225222 Eric Naslund, <a href="http://arxiv.org/abs/1211.2455">Bounds for the tail distribution of the sum of digits of prime numbers</a>, arXiv:1211.2455 [math.NT], 2012.
%H A225222 Eric Naslund, <a href="https://math.boku.ac.at/udt/vol10/no1/04naslund.pdf">The tail distribution of the sum of digits of prime numbers</a>, Uniform Distribution Theory 10 (2015), no. 1, 63-68. See the abstract and p. 64.
%t A225222 okQ[n_] := Module[{b = IntegerDigits[n, 2]}, Count[b, 1] > 2*Count[b, 0]]; Select[Prime[Range[200]], okQ] (* _T. D. Noe_, May 02 2013 *)
%o A225222 (PARI) has(n)=3*hammingweight(n)>2*#binary(n)
%o A225222 select(has,primes(500))
%Y A225222 Cf. A095070, A095314.
%K A225222 nonn,base
%O A225222 1,1
%A A225222 _Charles R Greathouse IV_, May 02 2013