OFFSET
1,1
COMMENTS
It is interesting to observe that it is hard to find (I found none) primes whose digit sum is 6. On the contrary, it is easier to find primes whose digit sum is 8.
The digit sum 6 does not occur here because a number with digit sum 6 is divisible by 3 and therefore not prime. - R. J. Mathar, Mar 26 2009
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
Chris Caldwell, The First 1,000 Primes
FORMULA
EXAMPLE
1061 is a prime whose digit sum is 8, which is a single-digit nonprime.
MAPLE
for i from 1 to 8 do if member(i, [1, 3, 7]) then S[1, i]:= {i} else S[1, i]:= {} fi od:
for d from 2 to 5 do
for x from 1 to 8 do
S[d, x]:= {};
for y from 0 to x-1 do
S[d, x]:= S[d, x] union map(t -> 10^(d-1)*y + t, S[d-1, x-y])
od od od:
select(isprime, S[5, 4] union S[5, 8]); # Robert Israel, Apr 14 2021
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Parthasarathy Nambi, Mar 21 2009
EXTENSIONS
Extended by R. J. Mathar, Mar 26 2009
STATUS
approved