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.

Showing 1-5 of 5 results.

A052433 Number of perfect connected undirected simple graphs on n nodes.

Original entry on oeis.org

1, 1, 2, 6, 20, 105, 724, 7805, 126777, 3122221, 112392709, 5736233644, 404604893810
Offset: 1

Views

Author

Keywords

Comments

The triangle of the multiset transform (undirected simple graphs on n>=0 nodes with 0<=k<=n components) starts:
1
0 1
0 1 1
0 2 1 1
0 6 3 1 1
0 20 8 3 1 1
0 105 29 9 3 1 1
0 724 137 31 9 3 1 1
0 7805 890 146 32 9 3 1 1
0 126777 8859 926 148 32 9 3 1 1
0 3122221 136870 9043 935 149 32 9 3 1 1
0 112392709 3271052 138026 9079 937 149 32 9 3 1 1
0 5736233644 115835359 3281756 138215 9088 938 149 32 9 3 1 1
0 404604893810 5855863577 115988462 3282936 138251 9090 938 149 32 9 3 1 1 (R. J. Mathar, Mar 12 2018)

References

  • A. Brandstaedt, V. B. Le and J. P. Spinrad, Graph Classes: A Survey, SIAM Publications, 1999.

Formula

Inverse Euler transform of A052431.

Extensions

More terms from Vladeta Jovovic, Jul 29 2003
a(12) using A052431 by Falk Hüffner, Jan 15 2016
a(13) using Brendan McKay's A052431(13) by Alois P. Heinz, Mar 11 2018

A187236 Number of simple imperfect graphs on n vertices.

Original entry on oeis.org

0, 0, 0, 0, 1, 8, 138, 3459, 137912, 8735904, 903185866, 159235673397, 50091451190693
Offset: 1

Views

Author

Eric W. Weisstein, Mar 07 2011

Keywords

Crossrefs

Formula

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

Extensions

a(13) from Alois P. Heinz, Aug 14 2019

A352209 Largest number of maximal perfect node-induced subgraphs of an n-node graph.

Original entry on oeis.org

1, 1, 1, 1, 5, 5, 13, 18, 42
Offset: 1

Views

Author

Pontus von Brömssen, Mar 08 2022

Keywords

Comments

This sequence is log-superadditive, i.e., a(m+n) >= a(m)*a(n). By Fekete's subadditive lemma, it follows that the limit of a(n)^(1/n) exists and equals the supremum of a(n)^(1/n).

Examples

			All graphs with at most four nodes are perfect, so a(n) = 1 for n <= 4 and any graph is optimal.
All optimal graphs (i.e., graphs that have n nodes and a(n) maximal perfect subgraphs) for 5 <= n <= 9 are listed below. Since a graph is perfect if and only if its complement is perfect, the optimal graphs come in complementary pairs.
  n = 5: the 5-cycle;
  n = 6: the wheel graph with any subset of the spokes removed (8 graphs in total);
  n = 7: the chestahedral graph and its complement;
  n = 8: the bislit cube graph, the snub disphenoidal graph, and their complements;
  n = 9: the bislit cube graph with an additional node with edges to two neighboring nodes of degree 4 and to the two nodes of degree 3 on the opposite face of the cube, the snub disphenoidal graph with an additional node with edges to the four nodes of degree 4, and their complements.
		

Crossrefs

For a list of related sequences, see cross-references in A342211.

Formula

a(m+n) >= a(m)*a(n).
Limit_{n->oo} a(n)^(1/n) >= 42^(1/9) = 1.51482... .

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

A287512 Number of simple perfect non-bipartite graphs on n vertices.

Original entry on oeis.org

0, 0, 1, 4, 20, 113, 818, 8584, 135637, 3263785, 115779695, 5855248060
Offset: 1

Views

Author

Eric W. Weisstein, May 26 2017

Keywords

Crossrefs

Formula

a(n) = A052431(n) - A033995(n), since all bipartite graphs are perfect. - Falk Hüffner, Aug 10 2017

Extensions

a(11)-a(12) from formula by Falk Hüffner, Aug 10 2017
Showing 1-5 of 5 results.