Number of graphical partitions (degree-vectors for graphs with n vertices, allowing self-loops which count as degree 1; or possible ordered row-sum vectors for a symmetric 0-1 matrix).
A029889
Number of graphical partitions (degree-vectors for graphs with n vertices, allowing self-loops which count as degree 1; or possible ordered row-sum vectors for a symmetric 0-1 matrix).
Terms
- a(0) =1a(1) =2a(2) =5a(3) =14a(4) =43a(5) =140a(6) =476a(7) =1664a(8) =5939a(9) =21518a(10) =78876a(11) =291784a(12) =1087441a(13) =4077662a(14) =15369327a(15) =58184110a(16) =221104527a(17) =842990294a(18) =3223339023
External references
- oeis: A029889