|
Search: id:A123544
|
|
|
| A123544 |
|
Number of connected labeled 2-regular relations of order n. |
|
+0
3
|
|
| 0, 0, 1, 6, 87, 1980, 66270, 3050460, 184716630, 14231775600, 1359481407480, 157694893448400, 21835679256606600, 3557942554594428000, 673941365091485290800, 146851484638349504613600
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1982.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 0..48
|
|
CROSSREFS
|
Connected version of A001499.
Sequence in context: A013527 A047786 A113666 this_sequence A138216 A122770 A127183
Adjacent sequences: A123541 A123542 A123543 this_sequence A123545 A123546 A123547
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 13 2006
|
|
|
Search completed in 0.002 seconds
|
