Number of unlabeled connected simple graphs with n edges rooted at one distinguished vertex.

A339039

Number of unlabeled connected simple graphs with n edges rooted at one distinguished vertex.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =5a(4) =13a(5) =37a(6) =114a(7) =367a(8) =1248a(9) =4446a(10) =16526a(11) =63914a(12) =256642a(13) =1067388a(14) =4590201a(15) =20376849a(16) =93240065a(17) =439190047a(18) =2126970482a(19) =10579017047a(20) =53983000003a(21) =282345671127

External references