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”).

A084280
Number of labeled 4-colorable (i.e., chromatic number <= 4) graphs on n nodes.
5
1, 2, 8, 64, 1023, 32596, 2062592, 257798069, 63135260853, 29939766625614, 27055039857514327
OFFSET
1,2
LINKS
S. R. Finch, Bipartite, k-colorable and k-colored graphs, June 5, 2003. [Cached copy, with permission of the author]
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 8c665c7
Eric Weisstein's World of Mathematics, n-Colorable Graph
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, May 25 2003
EXTENSIONS
a(7)-a(11) added using tinygraph by Falk Hüffner, Jun 20 2018
STATUS
approved