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.

A385523 Numbers that are not cycle counts of inseparable graphs.

Original entry on oeis.org

2, 4, 5, 8, 9, 16
Offset: 1

Views

Author

Thomas Zaslavsky, Jul 01 2025

Keywords

Comments

Since subdividing edges does not change the inseparability or the cycle count, the sequence holds equally for simple graphs and multigraphs.

Links

  • Ryan McCulloch, Brendan D. McKay, Alireza Salahshoori, and Thomas Zaslavsky, The Cycle Counts of Graphs, arXiv:2507.02260 [math.CO], 2025.

Crossrefs

Cf. A385524 (cubic graphs).

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

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