A215851 Number of simple labeled graphs on n nodes with exactly 1 connected component that is a tree or a cycle.
1, 1, 4, 19, 137, 1356, 17167, 264664, 4803129, 100181440, 2359762091, 61937322624, 1792399894837, 56697025885696, 1946238657504975, 72058247875111936, 2862433512904759793, 121439708940308299776, 5480390058971655049939, 262144060822550204416000
Offset: 1
Keywords
Examples
a(3) = 4: .1-2. .1-2. .1-2. .1 2. .|/ . .| . . / . .|/ . .3... .3... .3... .3...
Links
- Alois P. Heinz, Table of n, a(n) for n = 1..150
Programs
-
Maple
a:= n-> `if`(n<3, 1, (n-1)!/2+n^(n-2)): seq(a(n), n=1..25);