|
%I #13 Mar 16 2020 02:53:01
%S 1,1,3,8,22,60,173,471,1303,3510,9234,23574,58464,140340,326792,
%T 738090,1619321,3455129,7180856,14555856,28819926,55808840,105834657,
%U 196779279,359124362,643976482,1135731758,1971734302,3372477533
%N Number of loopless multigraphs with 7 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="/A014397/b014397.txt">Table of n, a(n) for n = 0..1000</a>
%o (PARI) concat([1], G(7, 30)) \\ See A191646 for G. - _Andrew Howroyd_, Mar 15 2020
%Y Row 7 of A192517.
%Y Cf. A001399, A003082, A014395, A014396, A014398.
%K nonn
%O 0,3
%A _N. J. A. Sloane_
%E More terms and better description from _Vladeta Jovovic_, Dec 29 1999
|
