cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A286949 Number of perfect disconnected simple graphs on n nodes.

Original entry on oeis.org

0, 1, 2, 5, 13, 43, 182, 1082, 9979, 147043, 3419289, 119265551
Offset: 1

Views

Author

Eric W. Weisstein, May 17 2017

Keywords

Examples

			\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.
		

Formula

a(n) = A052431(n) - A052433(n).