Birooted graphs: number of unlabeled graphs with n nodes rooted at 2 indistinguishable roots.

A303829

Birooted graphs: number of unlabeled graphs with n nodes rooted at 2 indistinguishable roots.

Terms

    a(0) =0a(1) =2a(2) =6a(3) =28a(4) =148a(5) =1144a(6) =13128a(7) =250240a(8) =8295664a(9) =494367376a(10) =53628829952

External references