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.
%I A387215 #9 Aug 23 2025 10:06:30 %S A387215 18,31,42,61,84,103,138,163,204,245,294,335,390,449,516,575,648,725, %T A387215 804,885,978,1067,1164,1277,1374,1493,1608,1739,1866,2003,2142,2291, %U A387215 2436,2603,2760,2933,3096,3281,3468,3647,3858,4055,4248,4457,4684,4913,5142,5375,5604 %N A387215 a(n) is the smallest k such that, for any m >= k, m is a sum of exactly n distinct primes. %C A387215 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. %e A387215 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. %Y A387215 Cf. A002375, A229219, A387198. %K A387215 nonn,new %O A387215 3,1 %A A387215 _David A. Corneth_, Aug 22 2025