The number of degree sequences with degree sum 2n representable by a non-separable graph (with multiple edges allowed).

A147877

The number of degree sequences with degree sum 2n representable by a non-separable graph (with multiple edges allowed).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =5a(5) =9a(6) =15a(7) =25a(8) =43a(9) =70a(10) =113a(11) =181a(12) =283a(13) =436a(14) =666a(15) =999a(16) =1483a(17) =2179a(18) =3166a(19) =4556a(20) =6504a(21) =9200a(22) =12918a(23) =18011a(24) =24938a(25) =34308a(26) =46928a(27) =63815a(28) =86324a(29) =116187

External references