login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A390256
Minimum size of maximum clique or independent set of a graph on n vertices.
1
0, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
(list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
This is the inverse sequence to the diagonal Ramsey numbers. See A059442.
LINKS
Table of n, a(n) for n=0..42.
Stanislaw Radziszowski, Small Ramsey Numbers, The Electronic Journal of Combinatorics, Dynamic Surveys, DS1, Mar 3 2017.
Eric Weisstein's World of Mathematics, Ramsey Number.
Wikipedia, Ramsey's theorem.
CROSSREFS
Cf. A059442, A212954.
Sequence in context: A092139 A084558 A320065 * A163291 A156875 A066339
Adjacent sequences: A390253 A390254 A390255 * A390257 A390258 A390259
KEYWORD
nonn,more
AUTHOR
Boris Alexeev, Oct 30 2025
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified January 17 21:54 EST 2026. Contains 392130 sequences.
License Agreements, Terms of Use, Privacy Policy