A243330 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A243330

Number of simple connected graphs with n nodes that are integral and Eulerian.

0

1, 0, 1, 1, 2, 2, 4, 4, 9, 20

(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. A003049 (Eulerian graphs), A064731 (integral graphs).

Sequence in context: A035054 A099537 A109525 * A318838 A231523 A114338

Adjacent sequences: A243327 A243328 A243329 * A243331 A243332 A243333

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, Jun 03 2014

STATUS

approved