This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A152652 Least prime p with digit sum A047235(n). 0
 2, 13, 17, 19, 59, 79, 389, 499, 1889, 1999, 6899, 17989, 39989, 49999, 98999, 199999, 599999, 799999, 2999999, 4999999, 9899999, 19999999 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA {min A000040(i): A007605(i)=A047234(n)}. - R. J. Mathar, Dec 12 2008 PROG (MAGMA) T:=[ n eq 1 select 2 else Self(n-1)+2*(1+n mod 2): n in [1..22] ]; S:=[]; p:=2; for k in T do while &+Intseq(p, 10) ne k do p:=NextPrime(p); end while; Append(~S, p); end for; S; // Klaus Brockhaus, Dec 13 2008 CROSSREFS Cf. A111380 (smallest prime whose digital sum is equal to the n-th composite number not congruent to 0 (modulo 3)). - Klaus Brockhaus, Dec 12 2008 Sequence in context: A153507 A124277 A038889 * A142339 A105913 A020480 Adjacent sequences:  A152649 A152650 A152651 * A152653 A152654 A152655 KEYWORD base,more,nonn AUTHOR Giovanni Teofilatto, Dec 10 2008 EXTENSIONS Edited and extended by R. J. Mathar, Dec 12 2008 a(20)-a(22) from Klaus Brockhaus, Dec 13 2008 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 March 22 17:25 EDT 2019. Contains 321422 sequences. (Running on oeis4.)