|
%I #13 Aug 15 2017 13:55:51
%S 1,0,1,1,2,5,21,120,1312,26525,1073690,84471633
%N Number of graphs with n nodes that are Hamiltonian 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 a1db88e
%Y Cf. A003216 (Hamiltonian graphs), A003049 (Eulerian graphs).
%K nonn,more
%O 1,5
%A _Travis Hoppe_ and _Anna Petrone_, Jun 02 2014
%E a(10)-a(11) added using tinygraph by _Falk Hüffner_, Aug 15 2017
|
