A387215 a(n) is the smallest k such that, for any m >= k, m is a sum of exactly n distinct primes.

18, 31, 42, 61, 84, 103, 138, 163, 204, 245, 294, 335, 390, 449, 516, 575, 648, 725, 804, 885, 978, 1067, 1164, 1277, 1374, 1493, 1608, 1739, 1866, 2003, 2142, 2291, 2436, 2603, 2760, 2933, 3096, 3281, 3468, 3647, 3858, 4055, 4248, 4457, 4684, 4913, 5142, 5375, 5604

Offset

3,1

Comments

In computation it is assumed that if for any m where a(n) = k <= m <= k + 3*n we have m is the sum of n distinct positive integers then a(n) = k.

Links

Table of n, a(n) for n=3..51.

Example

a(3) = 18 as 17 is not the sum of 3 distinct primes but any integer m where 18 <= m <= 27 is the sum of 3 distinct primes. It is therefore assumed that a(3) = 18.

Crossrefs

Cf. A002375, A229219, A387198.

Sequence in context: A101140 A287683 A182254 * A305220 A316798 A070744

Adjacent sequences: A387212 A387213 A387214 * A387216 A387217 A387218

Keyword

nonn

Author

David A. Corneth, Aug 22 2025

Status

approved