|
Search: id:A126101
|
|
|
| A126101 |
|
Number of connected unlabeled graphs on n nodes that are rooted at a non-cut node. |
|
+0
2
|
|
| 1, 1, 1, 2, 8, 44, 333, 3771, 67141, 2027119, 108880264, 10682138680, 1933264826485, 648235902085512, 404043306773404163, 1022090075330054063050850, 469727521267710406698, 32159402671814249205978139454278, 4176738163895992397728030132, 467987765188007308268883267776373304
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Same as A126100 except that the root node may not be a cut node, i.e. a node whose removal would disconnect the graph.
|
|
CROSSREFS
|
Cf. A001349, A126100.
Sequence in context: A005649 A005363 A123307 this_sequence A157994 A002500 A002833
Adjacent sequences: A126098 A126099 A126100 this_sequence A126102 A126103 A126104
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David Applegate (david(AT)research.att.com) and N. J. A. Sloane (njas(AT)research.att.com), Mar 06 2007
|
|
EXTENSIONS
|
a(6)-a(10) computed by Gordon Royle (gordon(AT)maths.uwa.edu.au), Mar 05 2007
a(11)-a(20) computed by David Applegate from A126100, Mar 07 2007
|
|
|
Search completed in 0.005 seconds
|
