A243335 Number of simple connected graphs with n nodes that are Eulerian and triangle-free.
1, 0, 0, 1, 1, 2, 3, 8, 19, 62, 229, 1192, 8147, 80182, 1106086
Offset: 1
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
- F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 69d4186.
Extensions
a(11)-a(15) added using tinygraph by Falk Hüffner, Jan 15 2016