login
Number of unlabeled graphs of odd girth at least 7 with n vertices.
1

%I #8 Jan 15 2023 01:45:17

%S 1,2,3,7,13,35,89,306,1141,5615,33397,260624,2623475,35100394,

%T 627244166,15122214205,493568138475

%N Number of unlabeled graphs of odd girth at least 7 with n vertices.

%C The odd girth of a graph is the length of a shortest cycle of odd length. Thus, these are the graphs (not necessarily connected) that do not have a triangle or C_5 as a subgraph. The bipartite graphs (which have no odd cycles) are included.

%Y EULER transform of A165452.

%K nonn,hard,more

%O 1,2

%A _Brendan McKay_, Jun 12 2021