login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243335 Number of simple connected graphs with n nodes that are Eulerian and triangle-free. 0
1, 0, 0, 1, 1, 2, 3, 8, 19, 62, 229, 1192, 8147, 80182, 1106086 (list; graph; refs; listen; history; text; internal format)
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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 22:42 EDT 2019. Contains 328378 sequences. (Running on oeis4.)