login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067180 Smallest prime with digit sum n, or 0 if no such prime exists. 8
0, 2, 3, 13, 5, 0, 7, 17, 0, 19, 29, 0, 67, 59, 0, 79, 89, 0, 199, 389, 0, 499, 599, 0, 997, 1889, 0, 1999, 2999, 0, 4999, 6899, 0, 17989, 8999, 0, 29989, 39989, 0, 49999, 59999, 0, 79999, 98999, 0, 199999, 389999, 0, 598999, 599999, 0, 799999, 989999, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(3k) = 0 for k>1.

LINKS

Table of n, a(n) for n=1..54.

EXAMPLE

a(68) = 59999999 because 59999999 is the smallest prime with digit sum = 68;

a(100) = 298999999999 because 298999999999 is the smallest prime with digit sum = 100.

MATHEMATICA

a = Table[0, {100}]; Do[b = Apply[ Plus, IntegerDigits[ Prime[n]]]; If[b < 101 && a[[b]] == 0, a[[b]] = Prime[n]], {n, 1, 10^7} ]; a

CROSSREFS

Cf. A054750.

Cf. Remove the 0 terms from this sequence and it leaves A067523.

Sequence in context: A196378 A051298 A069870 * A067182 A191000 A085402

Adjacent sequences:  A067177 A067178 A067179 * A067181 A067182 A067183

KEYWORD

easy,nonn,base

AUTHOR

Amarnath Murthy, Jan 09 2002

EXTENSIONS

Edited and extended by Robert G. Wilson v, Mar 01 2002

Edited by Ray Chandler, Apr 24 2007

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified July 31 05:26 EDT 2014. Contains 245079 sequences.