Sum over all unlabeled graphs of order n, of the number of graphs obtainable by deletion of a single vertex in the graph.

A336544

Sum over all unlabeled graphs of order n, of the number of graphs obtainable by deletion of a single vertex in the graph.

Terms

    a(0) =1a(1) =2a(2) =6a(3) =20a(4) =90a(5) =544a(6) =5096a(7) =79220a(8) =2208158a(9) =113737744a(10) =10926144928

External references