|
%I #8 Apr 16 2021 15:43:20
%S 0,0,0,0,1,1365,290745,35804384,3431889000,288982989000,
%T 22716104811840,1724903317684800,129165517275377154,
%U 9664573656742964960,728813888470620552600,55713446610261097382400,4334305420045397178746260,344080024970397555374419968,27923503603736889921687649020
%N Number of connected labeled graphs with n nodes and n+5 edges.
%H Andrew Howroyd, <a href="/A096117/b096117.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(17) and beyond from _Andrew Howroyd_, Apr 16 2021
|
