BBC Russian

A029892

Number of even graphical partitions of order 2n - number of odd graphical partitions of order 2n.

1, 3, 8, 27, 88, 313, 1095, 4007, 14511

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

The graphical partitions considered here are for graphs with 2n vertices and with half-loops allowed. Half-loops are loops which count as 1 towards the degree of the vertex. See A029889 for additional information. - Andrew Howroyd, Jan 11 2024

REFERENCES

R. A. Brualdi, H. J. Ryser, Combinatorial Matrix Theory, Cambridge Univ. Press, 1992.

LINKS

Table of n, a(n) for n=1..9.

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.

a(n) = A029891(2*n) - A029890(2*n). - Andrew Howroyd, Jan 10 2024

CROSSREFS

Cf. A000569, A004250, A004251, A029889, A029890, A029891.

Sequence in context: A148829 A148830 A148831 * A148832 A148833 A210680

Adjacent sequences: A029889 A029890 A029891 * A029893 A029894 A029895

KEYWORD

nonn,more

AUTHOR

TORSTEN.SILLKE(AT)LHSYSTEMS.COM

STATUS

approved