login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A243547
Number of simple connected graphs with n nodes that are Eulerian and have no subgraph isomorphic to the bowtie graph.
0
1, 0, 1, 1, 2, 4, 8, 35, 115, 629
OFFSET
1,5
LINKS
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014
CROSSREFS
Cf. A242792 (bowtie free graphs), A003049 (Eulerian graphs).
Sequence in context: A036544 A094334 A138744 * A263623 A070897 A180154
KEYWORD
nonn,more
AUTHOR
Travis Hoppe and Anna Petrone, Jun 06 2014
STATUS
approved