Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A164024
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A164024 Largest of smallest parts in partitions of n into exactly three primes. +0
3
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; listen)
OFFSET

6,1

COMMENT

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 9 2009)

LINKS

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: A093429 A089842 A071215 this_sequence A145193 A143117 A076221

Adjacent sequences: A164021 A164022 A164023 this_sequence A164025 A164026 A164027

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 08 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research