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,6

Links

Table of n, a(n) for n=1..15.

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.

Crossrefs

Cf. A003049 (Eulerian graphs), A024607 (triangle-free graphs).

Sequence in context: A148043 A321255 A243791 * A303835 A007999 A006609

Adjacent sequences: A243332 A243333 A243334 * A243336 A243337 A243338

Keyword

nonn,more

Author

Travis Hoppe and Anna Petrone, Jun 03 2014

Extensions

a(11)-a(15) added using tinygraph by Falk Hüffner, Jan 15 2016

Status

approved