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 A117076 #14 Jul 04 2022 04:44:35
%S A117076 2,223,227,229,241,263,269,281,283,401,409,421,443,449,461,463,467,
%T A117076 487,601,607,641,643,647,661,683,809,821,823,827,829,863,881,883,887,
%U A117076 2003,2027,2029,2063,2069,2081,2083,2087,2089,2203,2207,2221,2243,2267,2269
%N A117076 Prime numbers with more even digits than odd digits.
%C A117076 If a prime number's even digits are to outnumber its odd digits, it may not have two digits (as its last digit must be odd.) Neither may it begin with an odd digit if it has three or four digits. The smallest member of this sequence to begin with an odd digit is 10007.
%H A117076 Harvey P. Dale, <a href="/A117076/b117076.txt">Table of n, a(n) for n = 1..1000</a>
%e A117076 64969 is a member of this sequence as it is a prime with 3 even and only two odd digits. The primes on either side of it - 64951 and 64997 - are both non-members.
%t A117076 Select[Prime[Range[1000]],Sum[DigitCount[ # ][[2i - 1]], {i, 1,5}] < Sum[DigitCount[ # ][[2i]], {i, 1, 5}] &] (* _Stefan Steinerberger_, Apr 18 2006 *)
%t A117076 metoQ[n_]:=Module[{idn=IntegerDigits[n]},Count[idn,_?EvenQ]>Count[idn, _?OddQ]]; Select[Prime[Range[350]],metoQ] (* _Harvey P. Dale_, Oct 10 2018 *)
%o A117076 (PARI) select( {is_A117076(n)=isprime(n)&&vecsum(n=digits(n)%2)*2<#n}, primes(500)) \\ _M. F. Hasler_, Jul 03 2022
%K A117076 base,easy,nonn
%O A117076 1,1
%A A117076 _Andy Edwards_, Apr 18 2006
%E A117076 More terms from _Stefan Steinerberger_, Apr 18 2006