The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A073619 a(1) = 0; a(n) = smallest composite number which is a sum of n distinct primes. 5
 0, 8, 10, 21, 28, 45, 58, 77, 100, 129, 160, 201, 238, 285, 328, 381, 440, 501, 568, 639, 712, 791, 874, 963, 1060, 1161, 1264, 1371, 1480, 1593, 1720, 1851, 1988, 2127, 2276, 2427, 2584, 2747, 2914, 3087, 3266, 3447, 3638, 3831, 4028, 4227, 4438, 4661, 4888 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Jean-François Alcover, Conjectured terms up to a(200) FORMULA Min(a(n), A068873(n)) = A007504(n) for n > 1. - Jonathan Sondow, Jul 10 2012 EXAMPLE a(4) = 21 as 21 = 2+3+5+11 is the smallest composite number expressible as sum of four distinct primes. CROSSREFS Cf. A068873, A073620, A073621. Sequence in context: A281067 A070974 A300022 * A302429 A292999 A216047 Adjacent sequences:  A073616 A073617 A073618 * A073620 A073621 A073622 KEYWORD nonn AUTHOR Amarnath Murthy, Aug 07 2002 EXTENSIONS More terms from Sascha Kurz, Feb 03 2003 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 October 26 20:44 EDT 2020. Contains 338027 sequences. (Running on oeis4.)