login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A164024 Largest of smallest parts in partitions of n into exactly three primes. 2
2, 2, 2, 3, 2, 3, 2, 3, 2, 5, 2, 5, 2, 5, 2, 7, 2, 5, 2, 7, 2, 7, 2, 7, 2, 7, 2, 11, 2, 11, 2, 11, 2, 13, 2, 11, 2, 13, 2, 13, 2, 13, 2, 13, 2, 17, 2, 17, 2, 17, 2, 19, 2, 17, 2, 19, 2, 17, 2, 19, 2, 19, 2, 23, 2, 19, 2, 19, 2, 23, 2, 23, 2, 19, 2, 23, 2, 23, 2, 23, 2, 29, 2, 29, 2, 29, 2, 31, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

6,1

COMMENTS

a(even) = 2.

a(n)<=n/3; equality occurs at n= 3*prime, and then a(n) are new records 2,3,5,7,11,.. - Zak Seidov, Aug 09 2009

LINKS

Table of n, a(n) for n=6..94.

Index entries for sequences related to Goldbach conjecture

EXAMPLE

a(16) = max{min(2,3,11),min(2,7,7)} = max{2,2} = 2;

a(17) = max{min(2,2,13),min(3,3,11),min(3,7,7),min(5,5,7)} = max{2,2,3,5} = 5.

CROSSREFS

A164023, A068307.

Sequence in context: A252229 A318490 A071215 * A145193 A292585 A175872

Adjacent sequences:  A164021 A164022 A164023 * A164025 A164026 A164027

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 25 19:39 EST 2021. Contains 341618 sequences. (Running on oeis4.)