|
Search: id:A104211
|
|
|
| A104211 |
|
Integers n such that the sum of the digits of n is not prime. |
|
+0
2
|
|
| 1, 4, 6, 8, 9, 10, 13, 15, 17, 18, 19, 22, 24, 26, 27, 28, 31, 33, 35, 36, 37, 39, 40, 42, 44, 45, 46, 48, 51, 53, 54, 55, 57, 59, 60, 62, 63, 64, 66, 68, 69, 71, 72, 73, 75, 77, 78, 79, 80, 81, 82, 84, 86, 87, 88, 90, 91, 93, 95, 96, 97, 99, 100, 103, 105, 107, 108, 109, 112
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
Sum of digits of 15=6 not prime.
|
|
PROGRAM
|
(PARI) sdnotprime(n) = { local(x, y); for(x=1, n, y=sumdigits(x); if(!isprime(y), print1(x", ") ) ) } 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: A116661 A109104 A073303 this_sequence A132858 A071941 A164702
Adjacent sequences: A104208 A104209 A104210 this_sequence A104212 A104213 A104214
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Mar 13 2005
|
|
|
Search completed in 0.002 seconds
|
