Sum over all unlabeled connected graphs of order n, of the number of connected graphs obtainable by deletion of a single vertex in the graph.
A336545
Sum over all unlabeled connected graphs of order n, of the number of connected graphs obtainable by deletion of a single vertex in the graph.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =8a(4) =44a(5) =333a(6) =3771a(7) =67099a(8) =2026711a(9) =108874798a(10) =10682063400
External references
- oeis: A336545