The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243562 Number of simple connected graphs with n nodes that are Eulerian and have no subgraph isomorphic to diamond graph. 0
1, 0, 1, 1, 2, 3, 8, 21, 79, 334, 2190 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 13:07 EDT 2024. Contains 372533 sequences. (Running on oeis4.)