[go: up one dir, main page]

login
A096224
Number of connected labeled graphs with n nodes and n+8 edges.
4
0, 0, 0, 0, 0, 15, 54257, 30258935, 8403710364, 1624745199910, 253717024819170, 34644709397517912, 4336461198140896396, 512755474242717445740, 58441126001104710458595, 6511044113057606391228960, 716247426054164600104429648, 78368395883181612191026677504
OFFSET
1,6
LINKS
S. R. Finch, An exceptional convolutional recurrence, arXiv:2408.12440 [math.CO], 22 Aug 2024.
S. Janson, D. E. Knuth, T. Luczak 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.
Sequence in context: A358676 A013756 A078185 * A129613 A248734 A259210
KEYWORD
nonn
AUTHOR
Keith Briggs, Aug 09 2004
EXTENSIONS
Offset corrected and terms a(16) and beyond from Andrew Howroyd, Apr 16 2021
STATUS
approved