%I #8 Sep 14 2014 23:45:24

%S 1,0,1,1,2,2,4,4,9,20

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

%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>

%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014

%Y Cf. A003049 (Eulerian graphs), A064731 (integral graphs).

%K nonn,more

%O 1,5

%A _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014