Number of unlabeled simple graphs with n edges rooted at two indistinguishable vertices.

A339064

Number of unlabeled simple graphs with n edges rooted at two indistinguishable vertices.

Terms

    a(0) =1a(1) =3a(2) =9a(3) =28a(4) =87a(5) =276a(6) =909a(7) =3086a(8) =10879a(9) =39821a(10) =151363a(11) =597062a(12) =2442044a(13) =10342904a(14) =45301072a(15) =204895366a(16) =955661003a(17) =4590214994a(18) =22675644514a(19) =115068710553a(20) =599149303234

External references