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

A286949
Number of perfect disconnected simple graphs on n nodes.
0
0, 1, 2, 5, 13, 43, 182, 1082, 9979, 147043, 3419289, 119265551
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Disconnected Graph
Eric Weisstein's World of Mathematics, Perfect Graph
FORMULA
a(n) = A052431(n) - A052433(n).
EXAMPLE
\bar K_2; (1 graph)
\bar K_3, K_1 \cup K_2; (2 graphs)
\bar K_4, P_2 \cup 2 K_1, P_3 \cup K_1, C_3 \cup K_1, 2P_2 (5 graphs)
Here, \bar indicates a graph complement and \cup a (disjoint) graph union.
CROSSREFS
Sequence in context: A278171 A212824 A338660 * A287023 A287008 A119533
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, May 17 2017
STATUS
approved