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.
%I A345247 #8 Jan 15 2023 01:45:17 %S A345247 1,2,3,7,13,35,89,306,1141,5615,33397,260624,2623475,35100394, %T A345247 627244166,15122214205,493568138475 %N A345247 Number of unlabeled graphs of odd girth at least 7 with n vertices. %C A345247 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 A345247 EULER transform of A165452. %K A345247 nonn,hard,more %O A345247 1,2 %A A345247 _Brendan McKay_, Jun 12 2021