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!)
A076315 Number of 3-colorable (i.e., chromatic number <= 3) simple graphs on n nodes. 9
1, 2, 4, 10, 29, 119, 667, 6024, 88500, 2109828, 78347534, 4383817811 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..12.

Eric Weisstein's World of Mathematics, n-Colorable Graph

FORMULA

a(n) = A033995(n) + A076279(n). - Andrew Howroyd, Dec 02 2018

CROSSREFS

Cf. A033995, A076279, A076316, A076317, A076318, A076319, A076320, A076321.

Sequence in context: A047051 A271077 A126349 * A304124 A229905 A102667

Adjacent sequences:  A076312 A076313 A076314 * A076316 A076317 A076318

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein, Oct 06 2002

EXTENSIONS

a(10)-a(11) from Andrew Howroyd, Dec 02 2018

a(12) from Brendan McKay, Jan 19 2020

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 May 6 13:04 EDT 2021. Contains 343585 sequences. (Running on oeis4.)