|
|
A062336
|
|
Primes whose sum of digits is a multiple of 7.
|
|
3
|
|
|
7, 43, 59, 61, 149, 151, 167, 223, 239, 241, 257, 293, 313, 331, 347, 383, 419, 421, 491, 509, 563, 601, 617, 653, 743, 761, 941, 1033, 1049, 1051, 1123, 1193, 1213, 1229, 1231, 1283, 1303, 1319, 1321, 1373, 1409, 1427, 1481, 1553, 1571, 1607, 1733
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
419 is a prime with sum of digits = 14, hence belongs to the sequence.
|
|
MATHEMATICA
|
Select[Prime[Range[300]], Divisible[Total[IntegerDigits[#]], 7]&] (* Harvey P. Dale, Jun 27 2021 *)
|
|
PROG
|
(PARI) SumD(x)= { s=0; while (x>9, s+=x-10*(x\10); x\=10); return(s + x) } { n=0; forprime (p=2, 10^5, if (SumD(p)%7 == 0, write("b062336.txt", n++, " ", p); if (n==1000, break)) ) } \\ Harry J. Smith, Aug 05 2009
(Magma) [ p: p in PrimesUpTo(100000) | &+Intseq(p) mod 7 eq 0 ]; // Vincenzo Librandi, Apr 02 2011
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Jul 06 2001
|
|
STATUS
|
approved
|
|
|
|