login
a(n) = number of 2-digit primes with digit sum n, where n runs through the non-multiples of 3 in the range [2..17].
4

%I #23 Sep 18 2015 15:42:09

%S 1,2,2,2,3,3,3,1,1,2,1

%N a(n) = number of 2-digit primes with digit sum n, where n runs through the non-multiples of 3 in the range [2..17].

%H <a href="/A177868/b177868.txt">Table of n, a(n) for n = 1..11</a>

%H BigPrimes.net, <a href="http://www.bigprimes.net/sum-of-digits/">Digit sums of primes</a>

%e Digital sums of 2-digit primes

%e Sum count

%e 2 1

%e 4 2

%e 5 2

%e 7 2

%e 8 3

%e 10 3

%e 11 3

%e 13 1

%e 14 1

%e 16 2

%e 17 1

%Y For 2- through 9-digit primes the counts are in A177868, A178183, A178447, A178571, A178605, A178876, A178879, A178884.

%Y Cf. 2nd row of A178701.

%K nonn,base,fini,full

%O 1,2

%A _N. J. A. Sloane_, Dec 28 2010