This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A028834 Numbers n such that sum of digits of n is a prime. 26
 2, 3, 5, 7, 11, 12, 14, 16, 20, 21, 23, 25, 29, 30, 32, 34, 38, 41, 43, 47, 49, 50, 52, 56, 58, 61, 65, 67, 70, 74, 76, 83, 85, 89, 92, 94, 98, 101, 102, 104, 106, 110, 111, 113, 115, 119, 120, 122, 124, 128, 131, 133, 137, 139, 140, 142, 146, 148, 151, 155, 157, 160, 164, 166, 173, 175, 179, 182 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS T. D. Noe, Table of n, a(n) for n = 1..1000 MAPLE a:=proc(n) local nn: nn:=convert(n, base, 10): if isprime(sum(nn[j], j=1..nops(nn)))=true then n else fi end: seq(a(n), n=1..200); # Emeric Deutsch, Mar 17 2007 MATHEMATICA Select[Range[200], PrimeQ[Total[IntegerDigits[#]]]&]  (* Harvey P. Dale, Feb 18 2011 *) PROG (Haskell) a028834 n = a028834_list !! (n-1) a028834_list = filter ((== 1) . a010051 . a007953) [1..] -- Reinhard Zumkeller, Nov 13 2011 (Sage) [x for x in range(200) if (sum(Integer(x).digits(base=10))) in Primes()] # Bruno Berselli, May 05 2014 (PARI) is(n)=isprime(sumdigits(n)) \\ Felix FrÃ¶hlich, Aug 16 2014 CROSSREFS Cf. A007953, A028835, A028842, A052018, A052019, A052020, A052021, A052022. Cf. A010051; A046704 is a subsequence. Sequence in context: A212127 A307895 A028835 * A070026 A139750 A139749 Adjacent sequences:  A028831 A028832 A028833 * A028835 A028836 A028837 KEYWORD nonn,base,easy,nice AUTHOR Armand Turpel (armand(AT)vo.lu, armand_t(AT)geocities.com) EXTENSIONS More terms from Scott Lindhurst (ScottL(AT)alumni.princeton.edu) STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 16 23:49 EDT 2019. Contains 325092 sequences. (Running on oeis4.)