Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A096117
Number of connected labeled graphs with n nodes and n+5 edges.
4
0, 0, 0, 0, 1, 1365, 290745, 35804384, 3431889000, 288982989000, 22716104811840, 1724903317684800, 129165517275377154, 9664573656742964960, 728813888470620552600, 55713446610261097382400, 4334305420045397178746260, 344080024970397555374419968, 27923503603736889921687649020
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: A234501 A128285 A069310 * A140936 A022204 A015405
KEYWORD
nonn
AUTHOR
Keith Briggs, Aug 09 2004
EXTENSIONS
Offset corrected and terms a(17) and beyond from Andrew Howroyd, Apr 16 2021
STATUS
approved