|
%I #27 Nov 29 2023 11:41:51
%S 1,3,9,34,125,473,1779,6732,25492,96927,369463,1412700,5415117,
%T 20807502,80120350,309106496,1194609429,4624160156,17925278497,
%U 69578272204,270401326899,1052036082719,4097343156323,15973179953261,62325892264031,243392644741599
%N Number of graphical partitions of biconnected graphs with n nodes.
%D F. Ruskey, Alley CATs in search of good homes, Congress. Numerant., 102 (1994) 97-110.
%H Wang Kai, <a href="/A007722/b007722.txt">Table of n, a(n) for n = 3..101</a>
%H Kai Wang, <a href="https://arxiv.org/abs/1604.04148">Efficient Counting of Degree Sequences</a>, arXiv preprint arXiv:1604.04148 [math.CO], 2016-2017.
%H <a href="/index/Gra#graph_part">Index entries for sequences related to graphical partitions</a>
%Y Cf. A000569, A004250, A004251, A007721, A029889, A095268.
%K nonn
%O 3,2
%A _Frank Ruskey_
%E a(15)-a(28) added by _Kai Wang_, Feb 15 2017
|
