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.

A165452 Number of connected graphs of odd girth at least 7 with n vertices.

Original entry on oeis.org

1, 1, 1, 3, 5, 17, 45, 184, 748, 4143, 26532, 221032, 2326853, 32202266, 589436301, 14459238676, 477812658943
Offset: 1

Views

Author

Friedrich Regen (friedrich.regen(AT)tu-ilmenau.de), Sep 20 2009

Keywords

Comments

The odd girth of a graph is the length of a shortest cycle of odd length. Thus, these are the connected graphs that do not have a triangle or C_5 as induced subgraph. - Falk Hüffner, Jan 15 2016
The bipartite graphs (which have no odd cycles) are included.

Links

  • F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version ece94ef.

Crossrefs

Cf. A005142, A024607.
Inverse EULER transform of A345247.

Extensions

a(15) and a(16) added using tinygraph by Falk Hüffner, Jan 15 2016
a(17) added by Brendan McKay, Jun 12 2021
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.