Number of partitions of 2n that describe the degree sequence of exactly one labeled multigraph with no loops.

A328863

Number of partitions of 2n that describe the degree sequence of exactly one labeled multigraph with no loops.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =6a(4) =9a(5) =14a(6) =19a(7) =27a(8) =37a(9) =50a(10) =66a(11) =89a(12) =115a(13) =151a(14) =195a(15) =252a(16) =321a(17) =412a(18) =520a(19) =660a(20) =829a(21) =1042a(22) =1299a(23) =1623a(24) =2010a(25) =2492a(26) =3071a(27) =3783a(28) =4635a(29) =5679

External references