|
|
A005641
|
|
Number of 2-diregular digraphs with n nodes.
(Formerly M2757)
|
|
3
|
|
|
1, 3, 8, 27, 131, 711, 5055, 41607, 389759, 4065605, 46612528, 581713045, 7846380548, 113718755478, 1762208816647, 29073392136390, 508777045979418
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,2
|
|
COMMENTS
|
These graphs may have loops, whereas A219889 does not admit them. Both sequences do not admit multiedges. - R. J. Mathar, Mar 27 2019
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
CROSSREFS
|
Cf. A005642 (inverse Euler transform, connected graphs).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|