|
Search: id:A029889
|
|
|
| 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). |
|
+0
12
|
|
| 2, 5, 14, 43, 140, 476, 1664, 5939, 21518, 78876, 291784, 1087441, 4077662, 15369327, 58184110, 221104527, 842990294, 3223339023
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
R. A. Brualdi, H. J. Ryser, Combinatorial Matrix Theory, Cambridge Univ. Press, 1992.
|
|
LINKS
|
T. M. Barnes and C. D. Savage, A recurrence for counting graphical partitions, Electronic J. Combinatorics, 2 (1995)
Index entries for sequences related to graphical partitions
|
|
FORMULA
|
Calculated using Cor. 6.3.3, Th. 6.3.6, Cor. 6.2.5 of Brualdi-Ryser.
|
|
CROSSREFS
|
Cf. A000569, A004250, A004251.
Sequence in context: A052301 A071755 A066351 this_sequence A123020 A005317 A126566
Adjacent sequences: A029886 A029887 A029888 this_sequence A029890 A029891 A029892
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
TORSTEN.SILLKE(AT)LHSYSTEMS.COM
|
|
|
Search completed in 0.002 seconds
|
