A076167 - OEIS

%I #17 Nov 13 2024 08:28:50

%S 211,431,853,1021,1087,1201,1223,1289,1447,1627,2011,2213,2617,2671,

%T 2819,2837,3041,3221,3467,4013,4637,4673,4691,5443,5623,5689,5869,

%U 6217,6271,6473,6491,7283,7621,7643,7687,7823,7867,8017,8053,8219,8237,8273

%N Primes p such that sum of even digits of p equals sum of odd digits of p.

%C Numbers n such that sum of even digits equals sum of odd digits in A036301.

%H Robert Israel, <a href="/A076167/b076167.txt">Table of n, a(n) for n = 1..10000</a>

%e 2671 is OK because 2+6=7+1.

%p f:= proc(n) local Lo,Le;

%p   Lo,Le:= selectremove(type,convert(n,base,10),odd);

%p   abs(convert(Lo,`+`)-convert(Le,`+`))

%p end proc:

%p select(t -> f(t) = 0, [seq(ithprime(i),i=1..10000)]); # _Robert Israel_, Nov 13 2024

%t soeQ[n_]:=2*Total[Select[(x=IntegerDigits[n]),OddQ[#]&]]==Total[x]; Select[Prime[Range[1050]],soeQ[#]&] (* _Jayanta Basu_, May 23 2013 *)

%t Cases[{Total@# &/@GatherBy[IntegerDigits@#,OddQ], #}&/@

%t Prime@Range@3000, {{x_, x_}, y_} :> y] (* _Hans Rudolf Widmer_, Jul 26 2024 *)

%Y Cf. A036301, A111309.

%K nonn,base

%O 1,1

%A _Zak Seidov_, Nov 01 2002