Birooted graphs: number of unlabeled connected graphs with n nodes rooted at 2 indistinguishable roots.
A303831
Birooted graphs: number of unlabeled connected graphs with n nodes rooted at 2 indistinguishable roots.
Terms
- a(0) =0a(1) =1a(2) =3a(3) =16a(4) =98a(5) =879a(6) =11260a(7) =230505a(8) =7949596a(9) =483572280a(10) =53011686200
External references
- oeis: A303831