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

A339040

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

Terms

    a(0) =1a(1) =3a(2) =10a(3) =35a(4) =125a(5) =460a(6) =1747a(7) =6830a(8) =27502a(9) =113987a(10) =485971a(11) =2129956a(12) =9591009a(13) =44341610a(14) =210345962a(15) =1023182861a(16) =5100235807a(17) =26035673051a(18) =136023990102a(19) =726877123975

External references