cp's OEIS Frontend

A076167 Primes p such that sum of even digits of p equals sum of odd digits of p.

%I A076167 #22 Sep 05 2025 20:42:08
%S A076167 211,431,853,1021,1087,1201,1223,1289,1447,1627,2011,2213,2617,2671,
%T A076167 2819,2837,3041,3221,3467,4013,4637,4673,4691,5443,5623,5689,5869,
%U A076167 6217,6271,6473,6491,7283,7621,7643,7687,7823,7867,8017,8053,8219,8237,8273
%N A076167 Primes p such that sum of even digits of p equals sum of odd digits of p.
%C A076167 Primes in A036301.
%H A076167 Robert Israel, <a href="/A076167/b076167.txt">Table of n, a(n) for n = 1..10000</a>
%e A076167 2671 is OK because 2+6=7+1.
%p A076167 f:= proc(n) local Lo,Le;
%p A076167   Lo,Le:= selectremove(type,convert(n,base,10),odd);
%p A076167   abs(convert(Lo,`+`)-convert(Le,`+`))
%p A076167 end proc:
%p A076167 select(t -> f(t) = 0, [seq(ithprime(i),i=1..10000)]); # _Robert Israel_, Nov 13 2024
%t A076167 soeQ[n_]:=2*Total[Select[(x=IntegerDigits[n]),OddQ[#]&]]==Total[x]; Select[Prime[Range[1050]],soeQ[#]&] (* _Jayanta Basu_, May 23 2013 *)
%t A076167 Cases[{Total@# &/@GatherBy[IntegerDigits@#,OddQ], #}&/@
%t A076167 Prime@Range@3000, {{x_, x_}, y_} :> y] (* _Hans Rudolf Widmer_, Jul 26 2024 *)
%Y A076167 Intersection of A000040 and A036301,
%Y A076167 Cf. A111309.
%K A076167 nonn,base,changed
%O A076167 1,1
%A A076167 _Zak Seidov_, Nov 01 2002