A007722 Number of graphical partitions of biconnected graphs with n nodes.

1, 3, 9, 34, 125, 473, 1779, 6732, 25492, 96927, 369463, 1412700, 5415117, 20807502, 80120350, 309106496, 1194609429, 4624160156, 17925278497, 69578272204, 270401326899, 1052036082719, 4097343156323, 15973179953261, 62325892264031, 243392644741599

Offset

3,2

References

F. Ruskey, Alley CATs in search of good homes, Congress. Numerant., 102 (1994) 97-110.

Links

Wang Kai, Table of n, a(n) for n = 3..101

Kai Wang, Efficient Counting of Degree Sequences, arXiv preprint arXiv:1604.04148 [math.CO], 2016-2017.

Index entries for sequences related to graphical partitions

Crossrefs

Cf. A000569, A004250, A004251, A007721, A029889, A095268.

Sequence in context: A053791 A296223 A045627 * A149008 A149009 A149010

Adjacent sequences: A007719 A007720 A007721 * A007723 A007724 A007725

Keyword

nonn

Author

Frank Ruskey

Extensions

a(15)-a(28) added by Kai Wang, Feb 15 2017

Status

approved