%I #11 Apr 10 2020 21:05:33
%S 1,1,0,1,1,4,16,175,5274,434017,90658149,48825116761,68579602126387,
%T 254236892409251687,2512196983110257299898,66738846701458593981832314,
%U 4802164152196181961357340585741,942009012794429918939576183310877477,506665422212653541096106256584713063500057
%N Number of isomorphism classes of connected Eulerian oriented graphs with n vertices.
%C Loops and 2-cycles are not permitted. Eulerian means that each vertex has equal in-degree and out-degree.
%F Inverse Euler transform of A308161.
%Y Cf. A308161.
%K nonn,hard
%O 0,6
%A _Alois P. Heinz_, May 16 2019
%E Terms a(12) and beyond from _Andrew Howroyd_, Apr 10 2020