login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076279 Number of 3-chromatic (i.e., chromatic number equals 3) simple graphs on n nodes. 11

%I #21 Nov 09 2022 07:54:59

%S 0,0,1,3,16,84,579,5721,87381,2104349,78315231,4383566676,362178638727

%N Number of 3-chromatic (i.e., chromatic number equals 3) simple graphs on n nodes.

%H Keith M. Briggs, <a href="http://keithbriggs.info/cgt.html">Combinatorial Graph Theory</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/n-ChromaticGraph.html">n-Chromatic Graph</a>

%Y Column k=3 of A084268.

%Y Cf. A076278, A076280, A076281, A076282, A115597.

%K nonn,more

%O 1,4

%A _Eric W. Weisstein_, Oct 06 2002

%E a(10) from _Keith Briggs_, Mar 14 2006

%E a(11) from _Michael Sollami_, Jan 28 2012

%E a(12)-a(13) from _Brendan McKay_, Nov 08 2022

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 12:54 EDT 2024. Contains 371943 sequences. (Running on oeis4.)