A096224 Number of connected labeled graphs with n nodes and n+8 edges.

0, 0, 0, 0, 0, 15, 54257, 30258935, 8403710364, 1624745199910, 253717024819170, 34644709397517912, 4336461198140896396, 512755474242717445740, 58441126001104710458595, 6511044113057606391228960, 716247426054164600104429648, 78368395883181612191026677504

Offset: 1

Author

Keith Briggs, Aug 09 2004

Keywords

• nonn

Links

• Andrew Howroyd, Table of n, a(n) for n = 1..100
• S. R. Finch, An exceptional convolutional recurrence, arXiv:2408.12440 [math.CO], 22 Aug 2024.
• 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.

Extensions

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