|
Search: id:A104212
|
|
|
| A104212 |
|
Sum of the digits of n when the sum is prime. |
|
+0
1
|
|
| 2, 3, 5, 7, 2, 3, 5, 7, 2, 3, 5, 7, 11, 3, 5, 7, 11, 5, 7, 11, 13, 5, 7, 11, 13, 7, 11, 13, 7, 11, 13, 11, 13, 17, 11, 13, 17, 2, 3, 5, 7, 2, 3, 5, 7, 11, 3, 5, 7, 11, 5, 7, 11, 13, 5, 7, 11, 13, 7, 11, 13, 7, 11, 13, 11, 13, 17, 11, 13, 17, 11, 13, 17, 19, 2, 3, 5, 7, 11, 3, 5, 7, 11, 5, 7, 11
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
PROGRAM
|
(PARI) sdprime(n) = { local(x, y); for(x=1, n, y=sumdigits(x); if(isprime(y), print1(y", ") ) ) } sumdigits(n) = \ The sum of the digits of n { local(x, j, s=0); x=digits(n); for(j=1, length(x), s+=x[j]; ); return(s) } digits(n) = \ The vector of the digits of n { return(eval(Vec(Str(n)))) }
|
|
CROSSREFS
|
Sequence in context: A032759 A142711 A093338 this_sequence A139751 A076779 A074464
Adjacent sequences: A104209 A104210 A104211 this_sequence A104213 A104214 A104215
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Mar 13 2005
|
|
|
Search completed in 0.002 seconds
|
