A119450 Primes with odd digit sum.
3, 5, 7, 23, 29, 41, 43, 47, 61, 67, 83, 89, 113, 131, 137, 139, 151, 157, 173, 179, 191, 193, 197, 199, 223, 227, 229, 241, 263, 269, 281, 283, 311, 313, 317, 331, 337, 353, 359, 373, 379, 397, 401, 409, 421, 443, 449, 461, 463, 467, 487, 557, 571, 577, 593
Offset: 1
Links
- T. D. Noe, Table of n, a(n) for n = 1..10000
- Christian Mauduit and Joël Rivat, Sur un problème de Gelfond: la somme des chiffres des nombres premiers, Annals Math., 171 (2010), 1591-1646.
- ScienceDaily, Sum of Digits of Prime Numbers Is Evenly Distributed: New Mathematical Proof of Hypothesis, May 13, 2010.
Programs
-
Maple
select(t -> isprime(t) and convert(convert(t,base,10),`+`)::odd, [seq(i,i=3..1000,2)]); # Robert Israel, Feb 13 2017
-
Mathematica
Select[Prime@ Range@ 108, OddQ@ Total@ IntegerDigits@ # &] (* Michael De Vlieger, Feb 11 2017 *)
-
PARI
is(n)=isprime(n) && sumdigits(n)%2 \\ Charles R Greathouse IV, Feb 14 2017
Comments