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-1 of 1 results.

A345027 a(n) is the number of maximal chains of labeled split graphs with n vertices.

Original entry on oeis.org

1, 1, 6, 480, 719040, 28111985280, 39667596799259520, 2716101119587792215121920, 11750142295253741381979240922398720, 4059370170952132363824590307446791630779187200, 138004666315436722628999805261994204164032807656029840998400, 557103455087735168484078548670473120844063643381325957791547628642631680000
Offset: 1

Views

Author

Brendan McKay, Jun 06 2021

Keywords

Comments

A split graph is one which can be partitioned into a clique and an independent set.
a(n) is the number of sequences G[0], G[1], ..., G[n(n-1)/2] where each G[i] is a split graph with i edges and G[i] is a subgraph of G[i+1] for each i. All graphs are labeled.

Links

Crossrefs

Cf. A345024.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.