|
%I #13 Mar 16 2020 02:53:07
%S 1,1,3,8,23,64,197,588,1806,5509,16677,49505,143761,406091,1114890,
%T 2970964,7685972,19311709,47170674,112123118,259662333,586583731,
%U 1294143065,2791716176,5895027869,12198014683,24758285639,49339306519
%N Number of loopless multigraphs with 8 nodes and n edges.
%D CRC Handbook of Combinatorial Designs, 1996, p. 650.
%D F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 88, (4.1.18).
%H Andrew Howroyd, <a href="/A014398/b014398.txt">Table of n, a(n) for n = 0..1000</a>
%o (PARI) concat([1], G(8, 30)) \\ See A191646 for G. - _Andrew Howroyd_, Mar 15 2020
%Y Row 8 of A192517.
%Y Cf. A001399, A003082, A014395, A014396, A014397.
%K nonn
%O 0,3
%A _N. J. A. Sloane_
%E More terms and better description from _Vladeta Jovovic_, Dec 29 1999
|
