OFFSET
1,1
COMMENTS
On average, there are as many prime numbers for which the sum of decimal digits is even as prime numbers for which it is odd [A119450]. This hypothesis, first made in 1968, has recently been proved by researchers from the Institut de Mathematiques de Luminy.
Also primes such that absolute value of difference between largest digit and the sum of all the other digits is an odd integer. This is in accordance with hypothesis of Alexandre Gelfond, proved by C. Mauduit and J. Rivat as stated in Links section. - Osama Abuajamieh, Feb 10 2017
Considering the sequence digit sums, when prime, new maximum digit sums encounter the prime numbers themselves in order. This of course implies that, for any largest considered prime Pmax in this sequence, there will exist a larger entry P2 with digit sum = Pmax. Note the data available for such scrutiny grows very slowly - considering primes through 10^12 only attains digit sum to (prime) 97. Additionally, a parallel observation can be drawn about the behavior of companion sequence A119449. Also, this sequence appears to be a subset of A156756. - Bill McEachen, Mar 26 2017
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.
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 *)
PROG
(PARI) is(n)=isprime(n) && sumdigits(n)%2 \\ Charles R Greathouse IV, Feb 14 2017
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Zak Seidov, May 20 2006
STATUS
approved