A241782 Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a K_5, where a K_5 is the complete graph on five vertices.

1, 1, 2, 6, 20, 107, 802, 10252, 232850, 9905775

Offset

1,3

Links

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

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014

Crossrefs

Cf. similar graphs that are K_4 free, A079574.

Sequence in context: A052433 A078566 A076323 * A268562 A287009 A243252

Adjacent sequences: A241779 A241780 A241781 * A241783 A241784 A241785

Keyword

nonn,hard,more

Author

Travis Hoppe and Anna Petrone, Apr 28 2014

Status

approved