login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A164023
Smallest of largest parts in partitions of n into exactly three primes.
3
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, 11, 19, 13, 17, 13, 19, 13, 19, 17, 23, 17, 23, 17, 31, 17, 23, 19, 29, 17, 31, 19, 29, 19, 31, 19, 37, 23, 29, 23, 31, 23, 31, 23, 41, 29, 37, 23, 37, 29, 41, 31, 41, 29, 37, 29, 47, 31
OFFSET
6,1
COMMENTS
a(n) >= floor(n/3); a(A001748(n)) = A000040(n).
EXAMPLE
a(16) = min{max(2,3,11),max(2,7,7)} = min{11,7} = 7;
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.
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Aug 08 2009
STATUS
approved