login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
6,1
COMMENTS
a(n) >= floor(n/3); a(A001748(n)) = A000040(n).
LINKS
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
Sequence in context: A284374 A137847 A295820 * A097224 A087418 A087731
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Aug 08 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:12 EDT 2024. Contains 371964 sequences. (Running on oeis4.)