A198634 Number of weakly perfect graphs on n nodes.

1, 2, 4, 11, 33, 152, 1006, 11805, 257542, 11011758, 917095022, 145164791300

Offset

1,2

Comments

A graph is weakly perfect if it has equal chromatic and clique numbers.

First differs from A287007 (fractional chromatic number equals chromatic number) at a(8). - Eric W. Weisstein, May 17 2017

Links

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

F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 4361e42

Eric Weisstein's World of Mathematics, Weakly Perfect Graph

Formula

a(n) = A287009(n) + A287023(n).

Crossrefs

Cf. A287007, A287009, A287023.

Sequence in context: A076316 A304125 A082104 * A287007 A369843 A099215

Adjacent sequences: A198631 A198632 A198633 * A198635 A198636 A198637

Keyword

nonn,more

Author

Eric W. Weisstein, Feb 19 2013

Extensions

a(10) from Eric W. Weisstein, May 17 2017

a(11) added using tinygraph by Falk Hüffner, Aug 13 2017

a(12) added using tinygraph by Jakub Jablonski, Sep 26 2020

Status

approved