A243320 - OEIS

%I #17 Apr 06 2017 02:35:09

%S 1,0,0,1,0,2,1,6,7,29,64,287,1148,7267,55997,620561

%N Number of simple connected graphs with n nodes that are bipartite 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 [math.CO], 2014.

%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 69d4186

%Y Cf. A005142 (bipartite graphs), A003049 (Eulerian graphs).

%K nonn,more

%O 1,6

%A _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014

%E a(11)-a(16) added using tinygraph by _Falk Hüffner_, Jan 15 2016