|
%I #9 Apr 16 2021 15:44:14
%S 0,0,0,0,0,15,54257,30258935,8403710364,1624745199910,253717024819170,
%T 34644709397517912,4336461198140896396,512755474242717445740,
%U 58441126001104710458595,6511044113057606391228960,716247426054164600104429648,78368395883181612191026677504
%N Number of connected labeled graphs with n nodes and n+8 edges.
%H Andrew Howroyd, <a href="/A096224/b096224.txt">Table of n, a(n) for n = 1..100</a>
%H S. Janson, D. E. Knuth, T. Luczak and B. Pittel, <a href="http://dx.doi.org/10.1002/rsa.3240040303">The Birth of the Giant Component</a>, Random Structures and Algorithms Vol. 4 (1993), 233-358.
%Y A diagonal of A343088.
%Y Cf. A057500.
%K nonn
%O 1,6
%A _Keith Briggs_, Aug 09 2004
%E Offset corrected and terms a(16) and beyond from _Andrew Howroyd_, Apr 16 2021
|
