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 A119449 #43 Feb 15 2017 14:47:51 %S A119449 2,11,13,17,19,31,37,53,59,71,73,79,97,101,103,107,109,127,149,163, %T A119449 167,181,211,233,239,251,257,271,277,293,307,347,349,367,383,389,419, %U A119449 431,433,439,457,479,491,499,503,509,521,523,541,547,563,569,587,613,617 %N A119449 Primes with even digit sum. %C A119449 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. - _Jonathan Vos Post_, May 13 2010 %C A119449 Also primes such that absolute value of difference between largest digit and the sum of all the other digits is an even integer. This is in accordance with hypothesis of Alexandre Gelfond, proved by C. Mauduit and J. Rivat, see the link below. - _Osama Abuajamieh_, Feb 10 2017. %H A119449 T. D. Noe, <a href="/A119449/b119449.txt">Table of n, a(n) for n = 1..10000</a> %H A119449 Christian Mauduit and Joël Rivat, <a href="http://dx.doi.org/10.4007/annals.2010.171.1591">Sur un problème de Gelfond: la somme des chiffres des nombres premiers</a>, Annals Math., 171 (2010), 1591-1646. %H A119449 ScienceDaily, <a href="http://www.sciencedaily.com/releases/2010/05/100512172533.htm">Sum of Digits of Prime Numbers Is Evenly Distributed: New Mathematical Proof of Hypothesis</a>, May 13, 2010. %t A119449 Select[Prime@ Range@ 113, EvenQ@ Total@ IntegerDigits@ # &] (* _Michael De Vlieger_, Feb 11 2017 *) %o A119449 (PARI) isok(n) = isprime(n) && (sumdigits(n) % 2 == 0); \\ _Michel Marcus_, Oct 10 2013 %Y A119449 Intersection of A054683 and A000040. %Y A119449 Primes with odd digit sum A119450. %K A119449 base,nonn %O A119449 1,1 %A A119449 _Zak Seidov_, May 20 2006