A243562 Number of simple connected graphs with n nodes that are Eulerian and have no subgraph isomorphic to diamond graph.

1, 0, 1, 1, 2, 3, 8, 21, 79, 334, 2190

Offset

1,5

Links

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

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

Crossrefs

Cf. A242790 (diamond free graphs), A003049 (Eulerian graphs).

Sequence in context: A132730 A004790 A245464 * A238329 A272333 A098119

Adjacent sequences: A243559 A243560 A243561 * A243563 A243564 A243565

Keyword

nonn,more

Author

Travis Hoppe and Anna Petrone, Jun 06 2014

Extensions

a(11) from Max Alekseyev, Sep 12 2023

Status

approved