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

A076316
Number of 4-colorable (i.e., chromatic number <= 4) simple graphs on n nodes.
9
1, 2, 4, 11, 33, 150, 985, 11390, 243791, 9965456, 753402410
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, n-Colorable Graph
FORMULA
a(n) = A076315(n) + A076280(n). - Andrew Howroyd, Dec 02 2018
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Oct 06 2002
EXTENSIONS
a(10)-a(11) from Andrew Howroyd, Dec 02 2018
STATUS
approved