|
%I #14 Apr 16 2021 15:44:25
%S 0,0,0,0,0,1,20349,21426300,8956859646,2352103292070,470090359867986,
%T 79002015147719136,11836068369346126698,1640443794179544776604,
%U 215598057543037336382670,27336005392867324870778880,3385297472808136707459580488,413211903044379104303226531072
%N Number of connected labeled graphs with n nodes and n+9 edges.
%H Andrew Howroyd, <a href="/A182294/b182294.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.
%p N:=20: [seq(coeff(op(i,[seq(coeff(taylor(log(add(x^i*(1+y)^(binomial(i,2))/i!,i=0..N)),x=0,N+1),x,i)*i!,i=1..N)]),y,i-1+10),i=1..N)];
%Y A diagonal of A343088.
%Y Cf. A057500.
%K nonn
%O 1,7
%A _Michael Burkhart_, Apr 23 2012
%E Offset corrected and terms a(16) and beyond from _Andrew Howroyd_, Apr 16 2021
|
