A182371 Number of connected labeled graphs with n nodes and n+11 edges.

0, 0, 0, 0, 0, 0, 1330, 6905220, 7279892361, 3717889913655, 1255470137209650, 326123611416074340, 70993993399632155710, 13659118629343706026053, 2405832308811599670396135, 397496768417871214784702640, 62693059156926401902640364120, 9561367292987041683030275944320

Offset: 1

Author

Michael Burkhart, Apr 26 2012

Keywords

• nonn

Links

• Andrew Howroyd, Table of n, a(n) for n = 1..100
• S. Janson, D. E. Knuth, T. Łuczak and B. Pittel, The Birth of the Giant Component, Random Structures and Algorithms Vol. 4 (1993), 233-358.

Crossrefs

A diagonal of A343088.

Cf. A057500.

Programs

Maple

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)];

Extensions

Offset corrected and terms a(17) and beyond from Andrew Howroyd, Apr 16 2021