|
%I #12 Apr 16 2021 15:44:44
%S 0,0,0,0,0,0,1330,6905220,7279892361,3717889913655,1255470137209650,
%T 326123611416074340,70993993399632155710,13659118629343706026053,
%U 2405832308811599670396135,397496768417871214784702640,62693059156926401902640364120,9561367292987041683030275944320
%N Number of connected labeled graphs with n nodes and n+11 edges.
%H Andrew Howroyd, <a href="/A182371/b182371.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+12), i=1..N)];
%Y A diagonal of A343088.
%Y Cf. A057500.
%K nonn
%O 1,7
%A _Michael Burkhart_, Apr 26 2012
%E Offset corrected and terms a(17) and beyond from _Andrew Howroyd_, Apr 16 2021
|
