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 A333266 #13 Mar 18 2020 18:47:54 %S A333266 4,8,15,24,39,49,67,83,89,115,127,143,163,179,193,223,235,249,271,281, %T A333266 295,333,349,363,387,403,409,427,461,483,515,535,545,565,595,625,643, %U A333266 659,685,703,725,733,759,805,813,835,851,895,907,923,937,965,989,1033 %N A333266 a(n) is the smallest number k such that for all m >= k there is at least one prime partition of m with prime(n) as least part. %C A333266 a(n) is a term if and only if it is the smallest number such that there exists a prime partition of every m in the interval [a(n), 2*a(n)] with least part prime(n). There is no prime partition of a(n)-1 having prime(n) as least part, and this is the greatest such number. %e A333266 For any k >= 4 there exists a prime partition of k having least part 2, hence a(1)=4. %Y A333266 Cf. A333129, A333238, A330507, A000607, A333259. %K A333266 nonn %O A333266 1,1 %A A333266 _David James Sycamore_, Mar 13 2020 %E A333266 More terms from _Alois P. Heinz_, Mar 16 2020