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”).

A243336
Number of simple connected graphs with n nodes that are Eulerian and K_4 free.
0
1, 0, 1, 1, 3, 6, 22, 93, 656, 7484
OFFSET
1,5
COMMENTS
K_4 is the complete graph on four vertices.
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. A003049 (Eulerian graphs), A079574 (K_4 free graphs).
Sequence in context: A220166 A220167 A378731 * A344605 A029848 A366483
KEYWORD
nonn,more
AUTHOR
Travis Hoppe and Anna Petrone, Jun 03 2014
STATUS
approved