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 A164023 #4 Mar 30 2012 18:51:04 %S A164023 2,3,3,3,5,5,5,5,7,5,7,7,11,7,11,7,13,11,11,11,13,11,13,11,17,13,17, %T A164023 11,19,13,17,13,19,13,19,17,23,17,23,17,31,17,23,19,29,17,31,19,29,19, %U A164023 31,19,37,23,29,23,31,23,31,23,41,29,37,23,37,29,41,31,41,29,37,29,47,31 %N A164023 Smallest of largest parts in partitions of n into exactly three primes. %C A164023 a(n) >= floor(n/3); a(A001748(n)) = A000040(n). %H A164023 R. Zumkeller, <a href="/A164023/b164023.txt">Table of n, a(n) for n = 6..2500</a> %H A164023 <a href="/index/Go#Goldbach">Index entries for sequences related to Goldbach conjecture</a> %e A164023 a(16) = min{max(2,3,11),max(2,7,7)} = min{11,7} = 7; %e A164023 a(17) = min{max(2,2,13),max(2,3,11),max(3,7,7),max(5,5,7)} = min{13,11,7,7} = 7. %Y A164023 A164024, A068307. %K A164023 nonn %O A164023 6,1 %A A164023 _Reinhard Zumkeller_, Aug 08 2009