cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

David A. Corneth, Aug 22 2025

Keywords

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.

Examples

			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