|
|
A308239
|
|
Number of isomorphism classes of connected Eulerian oriented graphs with n vertices.
|
|
1
|
|
|
1, 1, 0, 1, 1, 4, 16, 175, 5274, 434017, 90658149, 48825116761, 68579602126387, 254236892409251687, 2512196983110257299898, 66738846701458593981832314, 4802164152196181961357340585741, 942009012794429918939576183310877477, 506665422212653541096106256584713063500057
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
COMMENTS
|
Loops and 2-cycles are not permitted. Eulerian means that each vertex has equal in-degree and out-degree.
|
|
LINKS
|
|
|
FORMULA
|
Inverse Euler transform of A308161.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|