login
a(1) = 0; a(n) = smallest composite number which is a sum of n distinct primes.
5

%I #12 Apr 22 2020 23:48:34

%S 0,8,10,21,28,45,58,77,100,129,160,201,238,285,328,381,440,501,568,

%T 639,712,791,874,963,1060,1161,1264,1371,1480,1593,1720,1851,1988,

%U 2127,2276,2427,2584,2747,2914,3087,3266,3447,3638,3831,4028,4227,4438,4661,4888

%N a(1) = 0; a(n) = smallest composite number which is a sum of n distinct primes.

%H Jean-François Alcover, <a href="/A073619/a073619.txt">Conjectured terms up to a(200)</a>

%F Min(a(n), A068873(n)) = A007504(n) for n > 1. - _Jonathan Sondow_, Jul 10 2012

%e a(4) = 21 as 21 = 2+3+5+11 is the smallest composite number expressible as sum of four distinct primes.

%Y Cf. A068873, A073620, A073621.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Aug 07 2002

%E More terms from _Sascha Kurz_, Feb 03 2003