|
%I #10 Nov 26 2015 14:31:11
%S 0,0,0,0,2,6,33,180,1773,31006
%N Number of simple connected graphs with n nodes that are Eulerian and not integral.
%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), A241842 (non-integral graphs).
%K nonn,more
%O 1,5
%A _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014
|
