

A165452


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


0



1, 1, 1, 3, 5, 17, 45, 184, 748, 4143, 26532, 221032, 2326853, 32202266, 589436301, 14459238676
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


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


LINKS

Table of n, a(n) for n=1..16.
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version ece94ef.


CROSSREFS

Cf. A005142, A024607.
Sequence in context: A236458 A131342 A005142 * A106063 A215106 A006483
Adjacent sequences: A165449 A165450 A165451 * A165453 A165454 A165455


KEYWORD

nonn


AUTHOR

Friedrich Regen (friedrich.regen(AT)tuilmenau.de), Sep 20 2009


EXTENSIONS

a(15) and a(16) added using tinygraph by Falk Hüffner, Jan 15 2016


STATUS

approved



