login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
Table of n, a(n) for n=1..10.
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
Adjacent sequences: A243544 A243545 A243546 * A243548 A243549 A243550
KEYWORD
nonn,more
AUTHOR
Travis Hoppe and Anna Petrone, Jun 06 2014
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 16 01:18 EST 2024. Contains 377778 sequences.
License Agreements, Terms of Use, Privacy Policy