A243324 - 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

A243324

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

0

0, 0, 0, 0, 2, 6, 33, 180, 1773, 31006

(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), A241842 (non-integral graphs).

Sequence in context: A098960 A162429 A279461 * A018952 A019028 A280769

Adjacent sequences: A243321 A243322 A243323 * A243325 A243326 A243327

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, Jun 03 2014

STATUS

approved