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

A339063

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

Terms

    a(0) =1a(1) =4a(2) =13a(3) =43a(4) =141a(5) =467a(6) =1588a(7) =5544a(8) =19966a(9) =74344a(10) =286395a(11) =1141611a(12) =4707358a(13) =20063872a(14) =88312177a(15) =400980431a(16) =1875954361a(17) =9032585846a(18) =44709095467a(19) =227245218669

External references