|
Search: id:A123543
|
|
|
| A123543 |
|
Number of connected labeled 2-regular pseudodigraphs (multiple arcs and loops allowed) of order n. |
|
+0
1
|
|
| 0, 1, 2, 14, 201, 4704, 160890, 7538040, 462869190, 36055948320, 3474195588360, 405786523413600, 56502317464777800, 9248640671612865600, 1758505909558569771600, 384399253128691423022400
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
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 A000681.
Adjacent sequences: A123540 A123541 A123542 this_sequence A123544 A123545 A123546
Sequence in context: A047796 A090300 A102224 this_sequence A054652 A122647 A136550
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Nov 13 2006
|
|
|
Search completed in 0.002 seconds
|
