|
Search: id:A052113
|
|
|
| A052113 |
|
Number of self-complementary directed 2-multigraphs with loops on n nodes. |
|
+0
1
|
|
| 1, 5, 41, 1023, 67173, 10771355, 5957216417, 6971880064072, 32181855124938673, 290910256437910060602, 11266525980714327353251353, 815201852317091835592374861144, 266236010885685869904935495261864265
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A 2-multigraph is similar to an ordinary graph except there are 0, 1 or 2 edges between any two nodes (self-loops are not allowed).
|
|
REFERENCES
|
V. Jovovic, On the number of m-place relations (in Russian), Logiko-algebraicheskie konstruktsii, Tver, 1992, 59-66.
|
|
CROSSREFS
|
Cf. A004105, A047832.
Sequence in context: A076094 A076131 A003719 this_sequence A093433 A065035 A145008
Adjacent sequences: A052110 A052111 A052112 this_sequence A052114 A052115 A052116
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 21 2000
|
|
|
Search completed in 0.002 seconds
|
